Shortest paths in digraphs of small treewidth. Part I: Sequential algorithms

Algorithmica (New York)

Volumn 27, Issue 3-4, 2000, Pages 212-226

  Chaudhuri, S ^a   Zaroliagis, C D ^a,b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF PATRAS   (Greece)

Author keywords

Dynamic algorithm; Graph theory; Shortest path; Treewidth

Indexed keywords

EID: 0003580702     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004530010016     Document Type: Article

References (17)

1. W. Ackermann, Zum Hilbertschen Aufbau der reellen Zahlen, Math. Ann., 99 (1928), 118-133.
2. R. Ahuja, T. Magnanti, and J. Orlin, Network Flows, Prentice-Hall, Englewood Cliffs, NJ, 1993.
3. N. Alon and B. Schieber, Optimal Preprocessing for Answering On-line Product Queries, Tech. Rep. No. 71/87, Tel Aviv University, 1987.
4. S. Arnborg, Efficient Algorithms for Combinatorial Problems on Graphs with Bounded Decomposability-A Survey, BIT, 25 (1985), 2-23.
5. S. Arnborg, J. Lagergren, and D. Seese, Easy Problems for Tree-Decomposable Graphs, J. Algorithms, 12 (1991), 308-340.
6. H. Bodlaender, A Tourist Guide through Treewidth, Acta Cybernet., 11(1-2) (1993), 1-21.
7. H. Bodlaender, Dynamic Algorithms for Graphs with Treewidth 2, in Proc. 19th WG' 93, pp. 112-124, Lecture Notes in Computer Science, vol. 790, Springer-Verlag, Berlin, 1994.
8. H. Bodlaender, A Linear Time Algorithm for Finding Tree-Decompositions of Small Treewidth, SIAM J. Comput., 25 (1996), 1305-1317.
9. B. Chazelle, Computing on a Free Tree via Complexity-Preserving Mappings, Algorithmica, 2 (1987), 337-361.
10. H. Djidjev, G. Pantziou, and C. Zaroliagis, On-Line and Dynamic Algorithms for Shortest Path Problems, in Proc. 12th STACS '95, pp. 193-204, Lecture Notes in Computer Science, vol. 900, Springer-Verlag, Berlin, 1995.
11. G.N. Frederickson, Planar Graph Decomposition and All Pairs Shortest Paths, J. Assoc. Comput. Mach., 38 (1991), 162-204.
12. G.N. Frederickson, Using Cellular Graph Embeddings in Solving All Pairs Shortest Path Problems, J. Algorithms, 19 (1995), 45-85.
13. G.N. Frederickson, Searching Among Intervals and Compact Routing Tables, Algorithmica, 15(5) (1996), 448-466.
14. M. Fredman and R. Tarjan, Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms, J. Assoc. Comput. Mach., 34 (1987), 596-615.
15. D. Kavvadias, G. Pantziou, P. Spirakis, and C. Zaroliagis, Efficient Sequential and Parallel Algorithms for the Negative Cycle Problem, in Proc. 5th ISAAC '94, pp. 270-278, Lecture Notes in Computer Science, vol. 834, Springer-Verlag, Berlin, 1994.
16. P. Klein, S. Rao, M. Rauch, and S. Subramanian, Faster Shortest-Path Algorithms for Planar Graphs, in Proc. 26th ACM Symp. on Theory of Computing, pp. 27-37, 1994.
17. N. Robertson and P. Seymour, Graph Minors, II: Algorithmic Aspects of Treewidth, J. Algorithms, 7 (1986), 309-322.