Advertisement

Parallel algorithms for series parallel graphs

  • Hans L. Bodlaender
  • Babette de Fluiter
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1136)

Abstract

In this paper, a parallel algorithm is given that, given a graph G=(V, E), decides whether G is a series parallel graph, and if so, builds a decomposition tree for G of series and parallel composition rules. The algorithm uses O(log¦E¦log*¦E¦) time and OE¦) operations on an EREW PRAM, andO(log¦E¦) time and OE¦) operations on a CRCW PRAM (note that if G is a simple series parallel graph, then ¦E¦=OV¦)). With the same time and processor resources, a tree-decomposition of width at most two can be built of a given series parallel graph, and hence, very efficient parallel algorithms can be found for a large number of graph problems on series parallel graphs, including many well known problems, e.g., all problems that can be stated in monadic second order logic. The results hold for undirected series parallel graphs graphs, as well as for directed series parallel graphs.

Keywords

Decomposition Tree Simple Path Reduction Rule Parallel Edge Conflict Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. Arnborg, B. Courcelle, A. Proskurowski, and D. Seese. An algebraic theory of graph reduction. J. ACM, 40:1134–1164, 1993.CrossRefGoogle Scholar
  2. 2.
    M. W. Bern, E. L. Lawler, and A. L. Wong. Linear time computation of optimal subgraphs of decomposable graphs. J. Algorithms, 8:216–235, 1987.CrossRefGoogle Scholar
  3. 3.
    H. L. Bodlaender and B. de Fluiter. Reduction algorithms for graphs with small treewidth. Technical Report UU-CS-1995-37, Department of Computer Science, Utrecht University, Utrecht, 1995.Google Scholar
  4. 4.
    H. L. Bodlaender and T. Hagerup. Parallel algorithms with optimal speedup for bounded treewidth. In Z. Fülöp and F. Gécseg, editors, Proceedings 22nd International Colloquium on Automata, Languages and Programming, pages 268–279, Berlin, 1995. Springer-Verlag, Lecture Notes in Computer Science 944.Google Scholar
  5. 5.
    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:555–581, 1992.CrossRefGoogle Scholar
  6. 6.
    R. J. Duffin. Topology of series-parallel graphs. J. Math. Anal. Appl., 10:303–318, 1965.CrossRefGoogle Scholar
  7. 7.
    D. Eppstein. Parallel recognition of series parallel graphs. Information and Computation, 98:41–55, 1992.Google Scholar
  8. 8.
    X. He and Y. Yesha. Parallel recognition and decomposition of two terminal series parallel graphs. Information and Computation, 75:15–38, 1987.Google Scholar
  9. 9.
    T. Kikuno, N. Yoshida, and Y. Kakuda. A linear algorithm for the domination number of a series-parallel graph. Disc. Appl. Math., 5:299–311, 1983.Google Scholar
  10. 10.
    K. Takamizawa, T. Nishizeki, and N. Saito. Linear-time computability of combinatorial problems on series-parallel graphs. J. ACM, 29:623–641, 1982.CrossRefGoogle Scholar
  11. 11.
    J. Valdes, R. E. Tarjan, and E. L. Lawler. The recognition of series parallel digraphs. SIAM J. Comput., 11:298–313, 1982.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Hans L. Bodlaender
    • 1
  • Babette de Fluiter
    • 1
  1. 1.Department of Computer ScienceUtrecht UniversityTB Utrechtthe Netherlands

Personalised recommendations