Efficient Message Routing in Planar Networks
- 1 August 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 18 (4) , 843-857
- https://doi.org/10.1137/0218058
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Space-Efficient Message Routing inc-Decomposable NetworksSIAM Journal on Computing, 1990
- Designing networks with compact routing tablesAlgorithmica, 1988
- Fast Algorithms for Shortest Paths in Planar Graphs, with ApplicationsSIAM Journal on Computing, 1987
- Finding small simple cycle separators for 2-connected planar graphsJournal of Computer and System Sciences, 1986
- Labelling and Implicit Routing in NetworksThe Computer Journal, 1985
- A Separator Theorem for Planar GraphsSIAM Journal on Applied Mathematics, 1979
- Hierarchical routing for large networks Performance evaluation and optimizationComputer Networks (1976), 1977
- Graph Theory with ApplicationsPublished by Springer Nature ,1976
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- Topology of series-parallel networksJournal of Mathematical Analysis and Applications, 1965