Parallel Algorithms with Optimal Speedup for Bounded Treewidth

We describe the first parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algorithm works in O((log n)2) time using O(n) operations on the EREW PRAM. We also give faster parallel algorithms with optimal speedup for the problem of deciding whether the treewidth of an input graph is bounded by a given constant and for a variety of problems on graphs of bounded treewidth, including all decision problems expressible in monadic second-order logic. On n-vertex input graphs, the algorithms use O(n) operations together with O(log nlog*n) time on the EREW PRAM, or O(log n) time on the CRCW PRAM.

[1]  Torben Hagerup,et al.  Fast deterministic processor allocation , 1993, SODA '93.

[2]  David G. Kirkpatrick,et al.  Parallel Construction of Subdivision Hierarchies , 1989, J. Comput. Syst. Sci..

[3]  Torben Hagerup.  Optimal Parallel Algorithms on Planar Graphs , 1990, Inf. Comput..

[4]  J. Lagergren.  Efficient parallel algorithms for tree-decomposition and related problems , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[5]  Richard Cole,et al.  Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time , 1988, SIAM J. Comput..

[6]  Chandrasekharan Narayanan.  Fast Parallel Algorithms and Enumeration Techniques for Partial k-trees , 1989 .

[7]  Naomi Nishimura,et al.  Characterizations of k-terminal flow networks and computing network flows in partial k-trees , 1995, SODA '95.

[8]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..

[9]  Paul D. Seymour,et al.  Graph minors. VI. Disjoint paths across a disc , 1986, J. Comb. Theory, Ser. B.

[10]  Paul D. Seymour,et al.  Graph Minors: XV. Giant Steps , 1996, J. Comb. Theory, Ser. B.

[11]  Hans L. Bodlaender,et al.  On Reduction Algorithms for Graphs with Small Treewidth , 1993, WG.

[12]  Neil Robertson,et al.  Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.

[13]  Hans L. Bodlaender,et al.  NC-Algorithms for Graphs with Small Treewidth , 1988, WG.

[14]  Bruno Courcelle,et al.  An algebraic theory of graph reduction , 1993, JACM.

[15]  Yijie Han,et al.  : Parallel Algorithms for Bucket Sorting and the Data Dependent Prefix Problem , 1986, ICPP.

[16]  Hans L. Bodlaender,et al.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.

[17]  Arthur L. Delcher,et al.  Optimal Parallel Evaluation of Tree-Structured Computations by Raking , 1988, AWOC.

[18]  Andrew V. Goldberg,et al.  Parallel Symmetry-Breaking in Sparse Graphs , 1988, SIAM J. Discret. Math..

[19]  Godfrey H. Hardy,et al.  An introduction to the theory of numbers (5. ed.) , 1995 .

[20]  Prabhakar Ragde,et al.  The Parallel Simplicity of Compaction and Chaining , 1990, J. Algorithms.

[21]  Gary L. Miller,et al.  Parallel tree contraction and its application , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[22]  David G. Kirkpatrick,et al.  A Simple Parallel Tree Contraction Algorithm , 1989, J. Algorithms.

[23]  S. Arnborg,et al.  Finding Minimal Forbidden Minors Using a Finite Congruence , 1991, ICALP.

[24]  Richard Cole,et al.  Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking , 2018, Inf. Control..

[25]  Samir Khuller,et al.  Efficient parallel algorithms for testing connectivity and finding disjoint s-t paths in graphs , 1989, 30th Annual Symposium on Foundations of Computer Science.

[26]  Marek Chrobak,et al.  Optimal Parallel 5-Colouring of Planar Graphs , 1989, SIAM J. Comput..

[27]  Richard Cole,et al.  Faster Optimal Parallel Prefix Sums and List Ranking , 1989, Inf. Comput..

[28]  Egon Wanke,et al.  Bounded Tree-Width and LOGCFL , 1993, J. Algorithms.

[29]  Derek G. Corneil,et al.  Complexity of finding embeddings in a k -tree , 1987 .

[30]  Bruce A. Reed,et al.  Finding approximate separators and computing tree width quickly , 1992, STOC '92.

[31]  Michael R. Fellows,et al.  On search decision and the efficiency of polynomial-time algorithms , 1989, STOC '89.

[32]  Robert E. Tarjan,et al.  An Efficient Parallel Biconnectivity Algorithm , 2011, SIAM J. Comput..

[33]  Ton Kloks,et al.  Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs , 1993, J. Algorithms.

[34]  Wojciech Rytter,et al.  Optimal Parallel Algorithm for Dynamic Expression Evaluation and Context-Free Recognition , 1989, Inf. Comput..

[35]  Sanguthevar Rajasekaran,et al.  Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms , 1989, SIAM J. Comput..

[36]  Hans L. Bodlaender,et al.  Improved Self-reduction Algorithms for Graphs with Bounded Treewidth , 1990, Discret. Appl. Math..

[37]  Harald Niederreiter,et al.  Introduction to finite fields and their applications: Preface , 1994 .

[38]  Robin Thomas,et al.  Algorithms Finding Tree-Decompositions of Graphs , 1991, J. Algorithms.

[39]  S. Teng,et al.  Optimal Tree Contraction in the EREW Model , 1988 .

[40]  Noga Alon,et al.  Simple Construction of Almost k-wise Independent Random Variables , 1992, Random Struct. Algorithms.

[41]  Noga Alon,et al.  A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.