Semi-dynamic shortest paths and breadth-first search in digraphs
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 33-46
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Shortest path queries in digraphs of small treewidthLecture Notes in Computer Science, 1995
- Faster shortest-path algorithms for planar graphs1994
- On the structure of DFS-forests on directed graphs and the dynamic maintenance of DFS on DAG's1994
- Dynamic algorithms for shortest paths in planar graphsTheoretical Computer Science, 1993
- A fully dynamic approximation scheme for all-pairs shortest paths in planar graphsLecture Notes in Computer Science, 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 THEORY1969
- A note on two problems in connexion with graphsNumerische Mathematik, 1959