Parallel algorithms for series parallel graphs
From MaRDI portal
Publication:4595494
DOI10.1007/3-540-61680-2_62zbMath1379.68333OpenAlexW2104397737WikidataQ59567982 ScholiaQ59567982MaRDI QIDQ4595494
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
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
Minimum Linear Arrangement of Series-Parallel Graphs ⋮ A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem ⋮ \#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method
This page was built for publication: Parallel algorithms for series parallel graphs
