论文信息 - Efficient parallel algorithms for tree-decomposition and related problems

Efficient parallel algorithms for tree-decomposition and related problems

An efficient parallel algorithm for the tree-decomposition problem for fixed width w is presented. The algorithm runs in time O(log/sup 3/ n) and uses O(n) processors on a concurrent-read, concurrent-write parallel random access machine (CRCW PRAM). This result can be used to construct efficient parallel algorithms for three important classes of problems: MS (monadic second-order) properties, linear EMS (extended monadic second-order) extremum problems, and enumeration problems for MS properties, for graphs of tree width at most w. The sequential time complexity of the tree-composition problem for fixed w is improved, and some implications for this improvement are stated.<<ETX>>

J. Lagergren

[1] Xin He,et al. Binary Tree Algebraic Computation and Parallel Algorithms for Simple Graphs , 1988, J. Algorithms.

[2] 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.

[3] Richard M. Karp,et al. A Survey of Parallel Algorithms for Shared-Memory Machines , 1988 .

[4] Frank Harary,et al. Graph Theory , 2016 .

[5] Paul D. Seymour,et al. Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

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

[7] Xin He,et al. Efficient Parallel Algorithms for Series Parallel Graphs , 1991, J. Algorithms.

[8] Elwood S. Buffa,et al. Graph Theory with Applications , 1977 .

[9] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

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

[11] Detlef Seese,et al. Easy Problems for Tree-Decomposable Graphs , 1991, J. Algorithms.

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