Parallel algorithms for series parallel graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1136, Issue , 1996, Pages 277-289

  Bodlaender, Hans L ^a   de Fluiter, Babette ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DIRECTED GRAPHS; FORESTRY; FORMAL LOGIC; GRAPH THEORY; GRAPHIC METHODS; PARALLEL ALGORITHMS;

DECOMPOSITION TREES; EREW PRAM; GRAPH PROBLEMS; MONADIC SECOND-ORDER LOGIC; PARALLEL COMPOSITION; PROCESSOR RESOURCES; SERIES-PARALLEL GRAPH; TREE DECOMPOSITION;

TREES (MATHEMATICS);

EID: 84958048006     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61680-2_62     Document Type: Conference Paper

References (11)

1. S. Arnborg, B. Courcelle, A. Proskurowski, and D. Seese. An algebraic theory of graph reduction. J. ACM, 40:1134-1164, 1993.
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.
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.
4. H. L. Bodlaender and T. Hagerup. Parallel algorithms with optimal speedup for bounded treewidth. In Z. Fülöp and E 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.
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.
6. R. J. Duffin. Topology of series-parallel graphs. J. Math. Anal, Appl., 10:303-318, 1965.
7. D. Eppstein. Parallel recognition of series parallel graphs. Information and Computation, 98:41-55, 1992.
8. X. He and Y Yesha. Parallel recognition and decomposition of two terminal series parallel graphs. Information and Computation, 75:15-38, 1987.
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.
10. K. Takamizawa, T. Nishizeki, and N. Saito. Linear-time computability of combinatorial problems on series-parallel graphs. J. ACM, 29:623-641, 1982.
11. J. Valdes, R. E. Tarjan, and E. L. Lawler. The recognition of series parallel digraphs. SIAM J. Comput.. 11:298-313, 1982.