Space-Efficient Message Routing inc-Decomposable Networks
- 1 February 1990
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 19 (1) , 164-181
- https://doi.org/10.1137/0219011
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Efficient Message Routing in Planar NetworksSIAM Journal on Computing, 1989
- Designing networks with compact routing tablesAlgorithmica, 1988
- Fast Algorithms for Shortest Paths in Planar Graphs, with ApplicationsSIAM Journal on Computing, 1987
- Efficient Algorithms for Optimization and Selection on Series-Parallel GraphsSIAM Journal on Algebraic Discrete Methods, 1986
- Finding small simple cycle separators for 2-connected planar graphsJournal of Computer and System Sciences, 1986
- A Separator Theorem for Planar GraphsSIAM Journal on Applied Mathematics, 1979
- Hierarchical routing for large networks Performance evaluation and optimizationComputer Networks (1976), 1977
- Efficient Algorithms for Shortest Paths in Sparse NetworksJournal of the ACM, 1977
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- Topology of series-parallel networksJournal of Mathematical Analysis and Applications, 1965