On-line and dynamic algorithms for shortest path problems
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 193-204
- https://doi.org/10.1007/3-540-59042-0_73
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Dynamic algorithms for shortest paths in planar graphsTheoretical Computer Science, 1993
- Efficient parallel shortest-paths in digraphs with a separator decompositionPublished by Association for Computing Machinery (ACM) ,1993
- Searching among intervals and compact routing tablesPublished by Springer Nature ,1993
- Sparsification-a technique for speeding up dynamic graph algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Incremental algorithms for minimal length pathsJournal of Algorithms, 1991
- Planar graph decomposition and all pairs shortest pathsJournal of the ACM, 1991
- Computing shortest paths and distances in planar graphsPublished by Springer Nature ,1991
- Using cellular graph embeddings in solving all pairs shortest paths problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Designing networks with compact routing tablesAlgorithmica, 1988
- Fast Algorithms for Shortest Paths in Planar Graphs, with ApplicationsSIAM Journal on Computing, 1987