论文信息 - Fast Parallel Decomposition by Clique Separators

Fast Parallel Decomposition by Clique Separators

We design a fast parallel algorithm for decomposing an arbitrtary graph by the clique separators. The algorithm works in $O(log^2 n)$ parallel time and $O(n^4)$ processors on a CREW-PRAM. It is the first sublinear parallel time (and therefore sequential sublinear space) algorithm for this problem.

Marek Karpinski | Elias Dahlhaus

[1] Fanica Gavril,et al. Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph , 1972, SIAM J. Comput..

[2] Mark K. Goldberg,et al. A new parallel algorithm for the maximal independent set problem , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[3] Richard C. T. Lee,et al. Efficient Parallel Algorithms for Finding Maximal Cliques, Clique Trees, and Minimum Coloring on Chordal Graphs , 1988, Inf. Process. Lett..

[4] Sue Whitesides,et al. An Algorithm for Finding Clique Cut-Sets , 1981, Inf. Process. Lett..

[5] Moni Naor,et al. Fast parallel algorithms for chordal graphs , 1987, STOC '87.

[6] Marek Karpinski,et al. A Fast Parallel Algorithm for Computing all Maximal Cliques in a Graph and the Related Problems (Extended Abstract) , 1988, SWAT.

[7] Stephen A. Cook,et al. A Taxonomy of Problems with Fast Parallel Algorithms , 1985, Inf. Control..

[8] Michael Luby,et al. A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.

[9] W. Cunningham. Decomposition of Directed Graphs , 1982 .

[10] Nobuji Saito,et al. Combinatorial problems on series-parallel graphs , 1980, Graph Theory and Algorithms.