Parallel algorithms for series parallel graphs
From MaRDI portal
Publication:4595494
DOI10.1007/3-540-61680-2_62zbMATH Open1379.68333OpenAlexW2104397737WikidataQ59567982 ScholiaQ59567982MaRDI QIDQ4595494FDOQ4595494
Authors: Babette de Fluiter, Hans L. Bodlaender 
Publication date: 5 December 2017
Published in: Algorithms — ESA '96 (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/18322
Recommendations
- Efficient parallel algorithms for series parallel graphs
- scientific article; zbMATH DE number 3905859
- Parallel algorithms for series parallel graphs and graphs with treewidth two
- Parallelizing sequential graph computations
- scientific article; zbMATH DE number 3972201
- Efficient parallel algorithms for graph problems
- On greedy algorithms for series parallel graphs
- scientific article; zbMATH DE number 3930349
- Parallel algorithms for parity graphs
- Parallel computations on graphs
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Cited In (18)
- Efficient parallel graph algorithms based on open ear decomposition
- A linear-time certifying algorithm for recognizing generalized series-parallel graphs
- \#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method
- Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs
- Parallel recognition and decomposition of two terminal series parallel graphs
- Title not available (Why is that?)
- Parallel recognition of series-parallel graphs
- Minimum Linear Arrangement of Series-Parallel Graphs
- Title not available (Why is that?)
- A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem
- Series-Parallel Operations with Alpha-Graphs
- Maximum independent number for series-parallel networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallel algorithms for series parallel graphs and graphs with treewidth two
- On the fundamental cycle set graph
- A compact labelling scheme for series-parallel graphs
- Space efficient algorithms for directed series–parallel graphs
This page was built for publication: Parallel algorithms for series parallel graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4595494)
