Parallel recognition of series parallel graphs
David Eppstein
Information & Computation 98(1):41–55, May 1992
Mathematical Reviews 92m:05180
http://www.ics.uci.edu/~eppstein/pubs/Epp-IC-92.pdf
Cited by:
- A new framework for designing parallel algorithms on series parallel graphs
- An efficient parallel algorithm for min-cost flow on directed series-parallel graphs
- Dynamic data structures for series parallel digraphs
- Edge coloring series parallel graphs
- Parallel algorithms for series parallel graphs
- Algorithms for Graphs of Small Treewidth
- An NC parallel algorithm for edge-coloring series-parallel multigraphs
- Divide-and-conquer algorithms for graph layout problems
- Parallel algorithms for treewidth two
- An efficient parallel strategy for computing $K$-terminal reliability and finding most vital edges in 2-trees and partial 2-trees
- Characterization and recognition of point-halfspace and related orders
- Parallel decomposition of generalized series-parallel graphs
- Applying Cilk in provably efficient task scheduling
- Space efficient algorithms for series-parallel graphs
- Parallel algorithms for series parallel graphs and graphs with treewidth two
- Distributed predicate detection in series-parallel systems
- Paths problems in symmetric logarithmic space
- Traversals of object structures: specification and efficient implementation
- Using PRAM algorithms on a uniform-memory-access shared-memory architecture
- Space efficient algorithms for directed series-parallel graphs
- Aggregation approach for the minimum binary cost tension problem
- Minimum convex-cost tension problems on series-parallel graphs
