Efficient parallel algorithms for series parallel graphs
References (23)
- et al.
A simple parallel tree contraction algorithm
J. Algorithms
(1989) - et al.
Linear-time computation of optimal subgraphs of decomposable graphs
J. Algorithms
(1987) - et al.
Routing, merging, and sorting on parallel models of computation
J. Comput. System Sci.
(1985) Topology of series parallel networks
J. Math. Anal. Appl.
(1965)- et al.
An improved parallel algorithm that computes the BFS numbering of a directed graph
Inform. Process. Lett.
(1988) - et al.
Parallel recognition and decomposition of two terminal series parallel graphs
Inform. Comput.
(1987) - et al.
Binary tree algebraic computation and parallel algorithms for simple graphs
J. Algorithms
(1988) - et al.
Parallel ear decomposition search (EDS) and s-t numbering in graphs
Theoret. Comput. Sci.
(1986) - et al.
A random NC algorithm for depth first search
- et al.
The Design and Analysis of Computer Algorithms
(1974)
Graph Theory with Applications
(1980)
Cited by (24)
Efficiently parallelizable problems on a class of decomposable graphs
2005, Journal of Computer and System SciencesAn efficient scheme to solve two problems for two-terminal series parallel graphs
1999, Information Processing LettersFast Algorithms for K<inf>4</inf> Immersion Testing
1999, Journal of AlgorithmsAn Efficient Parallel Strategy for ComputingK-Terminal Reliability and Finding Most Vital Edges in 2-Trees and Partial 2-Trees
1998, Journal of Parallel and Distributed ComputingAn NC Parallel Algorithm for Edge-Coloring Series-Parallel Multigraphs
1997, Journal of AlgorithmsEfficient Parallel Algorithms for Graphs of Bounded Tree-Width
1996, Journal of Algorithms
- ∗
Research supported in part by NSF grant CCR-9011214.
Copyright © 1991 Published by Elsevier Inc.