Parallel algorithms with optimal speedup for bounded treewidth

SIAM Journal on Computing

Volumn 27, Issue 6, 1998, Pages 1725-1746

  Bodlaender, Hans L ^a   Hagerup, Torben ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Derandomization; Graph algorithms; Graph reduction; Monadic second order logic; Parallel algorithms; Partial k trees; Pathwidth; Tree decomposition; Treewidth

Indexed keywords

DECISION THEORY; FORMAL LOGIC; OPTIMIZATION; PARALLEL ALGORITHMS;

MONADIC SECOND-ORDER LOGIC; TREE DECOMPOSITION;

TREES (MATHEMATICS);

EID: 0032320906     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539795289859     Document Type: Article

References (47)

1. K. ABRAHAMSON, N. DADOUN, D. G. KIRKPATRICK, AND T. PRZYTYCKA, A simple parallel tree contraction algorithm, J. Algorithms, 10 (1989), pp. 287-302.
2. N. ALON, L. BABAI, AND A. ITAI, A fast and simple randomized parallel algorithm for the maximal independent set problem, J. Algorithms, 7 (1986), pp. 567-583.
3. N. ALON, O. GOLDREICH, J. HÅSTAD, AND R. PERALTA, Simple constructions of almost k-wise independent random variables, Random Structures Algorithms, 3 (1992), pp. 289-304.
4. R. J. ANDERSON AND G. L. MILLER, Deterministic parallel list ranking, Algorithmica, 6 (1991), pp. 859-868.
5. S. ARNBORG, D. G. CORNEIL, AND A. PROSKUROWSKI, Complexity of finding embeddings in a k-tree, SIAM J. Alg. Discrete Methods, 8 (1987), pp. 277-284.
6. S. ARNBORG, B. COURCELLE, A. PROSKUROWSKI, AND D. SEESE, An algebraic theory of graph reduction, J. Assoc. Comput. Mach., 40 (1993), pp. 1134-1164.
7. H. L. BODLAENDER, NC-algorithms for graphs with small treewidth, in Proc. 14th International Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science 344, J. van Leeuwen, ed., Springer-Verlag, Berlin, 1989, pp. 1-10.
8. H. L. BODLAENDER, A linear time algorithm for finding tree-decompositions of small treewidth, SIAM J. Comput., 25 (1996), pp. 1305-1317.
9. H. L. BODLAENDER, On reduction algorithms for graphs with small treewidth, in Proc. 19th International Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science 790, J. van Leeuwen, ed., Springer-Verlag, Berlin, 1994, pp. 45-56.
10. H. L. BODLAENDER, Improved self-reduction algorithms for graphs with bounded treewidth, Discrete Appl. Math., 54 (1994), pp. 101-115.
11. H. L. BODLAENDER, A Partial k-Arboretum of Graphs with Bounded Treewidth, Tech. Report UU-CS-1996-02, Department of Computer Science, Utrecht University, Utrecht, the Netherlands, 1996;
12. Theoret. Comput. Sci., to appear.
13. H. L. BODLAENDER AND B. DE FLUITER, Parallel algorithms for series parallel graphs, in Proc. 4th Annual European Symposium on Algorithms, Lecture Notes in Computer Science 1136, J. Diaz and M. Serna, eds., Springer-Verlag, Berlin, 1996, pp. 277-289.
14. H. L. BODLAENDER AND T. KLOKS, Efficient and constructive algorithms for the pathwidth and treewidth of graphs, J. Algorithms, 21 (1996), pp. 358-402.
15. R. B. BORIE, R. G. PARKER, AND C. A. TOVEY, Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families, Algorithmica, 7 (1992), pp. 555-581.
16. N. CHANDRASEKHARAN, Fast Parallel Algorithms and Enumeration Techniques for Partial k-Trees, Ph.D. thesis, Clemson University, Clemson, SC, 1989.
17. N. CHANDRASEKHARAN AND S. T. HEDETNIEMI, Fast parallel algorithms for tree decomposing and parsing partial k-trees, in Proc. 26th Annual Allerton Conference on Communication, Control, and Computing, Urbana-Champaign, IL, 1988, pp. 283-292.
18. R. COLE AND U. VISHKIN, Approximate parallel scheduling. Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time, SIAM J. Comput., 17 (1988), pp. 128-142.
19. R. COLE AND U. VISHKIN, The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time, Algorithmica, 3 (1988), pp. 329-346.
20. R. COLE AND U. VISHKIN, Faster optimal parallel prefix sums and list ranking, Inform. and Comput., 81 (1989), pp. 334-352.
21. B. COURCELLE, The monadic second-order logic of graphs I. Recognizable sets of finite graphs, Inform. and Comput., 85 (1990), pp. 12-75.
22. N. DADOUN AND D. G. KIRKPATRICK, Parallel construction of subdivision hierarchies, J. Comput. System Sci., 39 (1989), pp. 153-165.
23. M. R. FELLOWS AND M. A. LANGSTON, On search, decision, and the efficiency of polynomial-time algorithms, J. Comput. System Sci., 49 (1994), pp. 769-779.
24. B. DE FLUITER AND H. L. BODLAENDER, Parallel algorithms for treewidth two, in Proc. 23rd International Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science 1335, R. H. Möhring, ed., Springer-Verlag, Berlin, 1997, pp. 157-170.
25. H. GAZIT, G. L. MILLER, AND S.-H. TENG, Optimal tree contraction in an EREW model, in Concurrent Computations: Algorithms, Architecture, and Technology, S. K. Tewksbury, B. W. Dickinson, and S. C. Schwartz, eds., Plenum Press, New York, 1988, pp. 139-156.
26. A. GIBBONS AND W. RYTTER, Optimal parallel algorithms for dynamic expression evaluation and context-free recognition, Inform. and Comput., 81 (1989), pp. 32-45.
27. A. V. GOLDBERG, S. A. PLOTKIN, AND G. E. SHANNON, Parallel symmetry-breaking in sparse graphs, SIAM J. Discrete Math., 1 (1988), pp. 434-446.
28. D. GRANOT AND D. SKORIN-KAPOV, NC algorithms for recognizing partial 2-trees and 3-trees, SIAM J. Discrete Math., 4 (1991), pp. 342-354.
29. T. HAGERUP, Optimal parallel algorithms on planar graphs, Inform. and Comput., 84 (1990), pp. 71-96.
30. T. HAGERUP, Fast deterministic processor allocation, J. Algorithms, 18 (1995), pp. 629-649.
31. T. HAGERUP, M. CHROBAK, AND K. DIKS, Optimal parallel 5-colouring of planar graphs, SIAM J. Comput., 18 (1989), pp. 288-300.
32. T. HAGERUP, J. KATAJAINEN, N. NISHIMURA, AND P. RAGDE, Characterizations of k-terminal flow networks and computing network flows in partial k-trees, in Proc. 6th Annual ACM-SIAM Symposium on Discrete Algorithms, 1995, pp. 641-649;
33. J. Comput. System Sci., to appear.
34. G. H. HARDY AND E. M. WRIGHT, An Introduction to the Theory of Numbers, 5th ed., Oxford University Press, Oxford, 1979.
35. S. KHULLER AND B. SCHIEBER, Efficient parallel algorithms for testing k-connectivity and finding disjoint s-t paths in graphs, SIAM J. Comput., 20 (1991), pp. 352-375.
36. S. R. KOSARAJU AND A. L. BELCHER, Optimal parallel evaluation of tree-structured computations by raking, in Proc. 3rd Aegean Workshop on Computing, Lecture Notes in Computer Science 319, J. H. Reif, ed., Springer-Verlag, Berlin, 1988, pp. 101-110.
37. J. LAGERGREN, Efficient parallel algorithms for graphs of bounded tree-width, J. Algorithms, 20 (1996), pp. 20-44.
38. J. LAGERGREN AND S. ARNBORG, Finding minimal forbidden minors using a finite congruence, in Proc. 18th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science 510, J. Leach Albert, M. Rodríguez Artalejo, and B. Monien, eds., Springer-Verlag, Berlin, 1991, pp. 532-543.
39. R. LIDL AND H. NIEDERREITER, Introduction to Finite Fields and their Applications, Cambridge University Press, Cambridge, 1986.
40. J. MATOUŠEK AND R. THOMAS, Algorithms finding tree-decompositions of graphs, J. Algorithms, 12 (1991), pp. 1-22.
41. G. L. MILLER AND J. H. REIF, Parallel tree contraction and its application, in Proc. 26th Annual Symposium on Foundations of Computer Science, 1985, pp. 478-489.
42. P. RAGDE, The parallel simplicity of compaction and chaining, J. Algorithms, 14 (1993), pp. 371-380.
43. S. RAJASEKARAN AND J. H. REIF, Optimal and sublogarithmic time randomized parallel sorting algorithms, SIAM J. Comput., 18 (1989), pp. 594-607.
44. B. A. REED, Finding approximate separators and computing tree width quickly, in Proc. 24th Annual ACM Symposium on the Theory of Computing, 1992, pp. 221-228.
45. N. ROBERTSON AND P. D. SEYMOUR, Graph minors. XIII. The disjoint paths problem, J. Combin. Theory Ser. B., 63 (1995), pp. 65-110.
46. R. E. TARJAN AND U. VISHKIN, An efficient parallel biconnectivity algorithm, SIAM J. Comput., 14 (1985), pp. 862-874.
47. E. WANKE, Bounded tree-width and LOGCFL, J. Algorithms, 16 (1994), pp. 470-491.