Shortest path queries in digraphs of small treewidth
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 244-255
- https://doi.org/10.1007/3-540-60084-1_78
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- On-line and dynamic algorithms for shortest path problemsPublished by Springer Nature ,1995
- Dynamic algorithms for graphs with treewidth 2Published by Springer Nature ,1994
- Dynamic algorithms for shortest paths in planar graphsTheoretical Computer Science, 1993
- A linear time algorithm for finding tree-decompositions of small treewidthPublished by Association for Computing Machinery (ACM) ,1993
- Searching among intervals and compact routing tablesPublished by Springer Nature ,1993
- Planar graph decomposition and all pairs shortest pathsJournal of the ACM, 1991
- Fast Algorithms for Shortest Paths in Planar Graphs, with ApplicationsSIAM Journal on Computing, 1987
- Computing on a free tree via complexity-preserving mappingsAlgorithmica, 1987
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 1985