Shortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithms

Theoretical Computer Science

Volumn 203, Issue 2, 1998, Pages 205-223

  Chaudhuri, Shiva ^a   Zaroliagis, Christos D ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Dynamic algorithm; Graph theory; Parallel computing; PRAM; Shortest path; Treewidth

Indexed keywords

EID: 0012619332     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00021-8     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, J. Orlin, Network Flows, Prentice-Hall, Englewood Cliffs, NJ, 1993.
3. N. Alon, 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. H. Bodlaender, NC-algorithms for graphs with small treewidth, in: Proc. 14th Workshop on Graph-Theoretic Concepts in Comp. Sci. (WG'88), Lecture Notes in Computer Science, vol. 344, Springer, Berlin, 1989, pp. 1-10.
6. H. Bodlaender, A tourist guide through treewidth, Acta Cybernet. 11 (1-2) (1993) 1-21.
7. H. Bodlaender, T. Hagerup, Parallel algorithms with optimal speedup for bounded treewidth, in: Proc. 22nd Internat. Coll. on Automata, Languages and Programming (ICALP'95), Lecture Notes in Computer Science, vol. 944, Springer, Berlin, 1995, pp. 268-279.
8. S. Chaudhuri, C. Zaroliagis, Shortest path queries in digraphs of small treewidth, in: Proc. 22nd Internat Coll. on Automata, Languages and Programming (ICALP'95), Lecture Notes in Computer Science, vol. 944, Springer, Berlin, 1995, pp. 244-255; full version, as Shortest paths in digraphs of small treewidth. Part I: sequential algorithms, in Algorithmica, to appear.
9. E. Cohen, Efficient parallel shortest-paths in digraphs with a separator decomposition, in: Proc. 5th ACM Symp. on Parallel Algorithms and Architectures, 1993, pp. 57-67.
10. H. Djidjev, G. Pantziou, C. Zaroliagis, On-line and dynamic algorithms for shortest path problems, in: Proc. 12th Symp. on Theor. Aspects of Comp. Sci. (STACS'95), Lecture Notes in Computer Science, vol. 900, Springer, Berlin, 1995, pp. 193-204.
11. Y. Han, V. Pan, J. Reif, Efficient parallel algorithms for computing all pair shortest paths in directed graphs, in: Proc. 4th ACM Symp. on Parallel Algorithms and Architectures, 1992, pp. 353-362.
12. J. JáJá, An Introduction to Parallel Algorithms, Addison-Wesley, Reading, MA, 1992.
13. D. Kavvadias, G. Pantziou, P. Spirakis, C. Zaroliagis, Efficient sequential and parallel algorithms for the negative cycle problem, in: Proc. 5th Internat Symp. on Algorithms and Computation (ISAAC'94), Lecture Notes in Computer Science, vol. 834, Springer, Berlin, 1994, pp. 270-278.
14. P. Klein, S. Subramanian, A linear-processor polylog-time algorithm for shortest paths in planar graphs, in: Proc. 34th IEEE Symp. on Foundations of Comp. Sci., 1993, pp. 259-270.
15. N. Robertson, P. Seymour, Graph minors I: excluding a forest, J. Combin. Theory Ser. B 35 (1983) 39-61.
16. N. Robertson, P. Seymour, Graph minors II: algorithmic aspects of treewidth, J. Algorithms 7 (1986) 309-322.
17. B. Schieber, U. Vishkin, On finding lowest common ancestors: simplification and parallelization, SIAM J. Comput. 17 (6) (1988) 1253-1262.