Computing shortest paths and distances in planar graphs
- 1 January 1991
- book chapter
- Published by Springer Nature
- p. 327-338
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Incremental algorithms for minimal length pathsJournal of Algorithms, 1991
- Efficient parallel algorithms for path problems in planar directed graphsLecture Notes in Computer Science, 1990
- Efficient parallel algorithms for shortest paths in planar graphsLecture Notes in Computer Science, 1990
- Designing networks with compact routing tablesAlgorithmica, 1988
- On the Complexity of Covering Vertices by Faces in a Planar GraphSIAM Journal on Computing, 1988
- Fast Algorithms for Shortest Paths in Planar Graphs, with ApplicationsSIAM Journal on Computing, 1987
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- A new approach to all pairs shortest paths in planar graphs1987
- Computer Networks with Compact Routing Tables1986
- An Efficient Parallel Biconnectivity AlgorithmSIAM Journal on Computing, 1985