Semi-dynamic shortest paths and breadth-first search in digraphs
- 1 January 1997
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Shortest path queries in digraphs of small treewidthPublished by Springer Nature ,1995
- Faster shortest-path algorithms for planar graphsPublished by Association for Computing Machinery (ACM) ,1994
- On the structure of DFS-forests on directed graphs and the dynamic maintenance of DFS on DAG'sPublished by Springer Nature ,1994
- Dynamic algorithms for shortest paths in planar graphsTheoretical Computer Science, 1993
- A fully dynamic approximation scheme for all-pairs shortest paths in planar graphsPublished by Springer Nature ,1993
- Incremental algorithms for minimal length pathsJournal of Algorithms, 1991
- Recognizing breadth-first search trees in linear timeInformation Processing Letters, 1990
- An On-Line Edge-Deletion ProblemJournal of the ACM, 1981
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- A note on two problems in connexion with graphsNumerische Mathematik, 1959