Efficient parallel algorithms for series parallel graphs

DOI10.1016/0196-6774(91)90012-NzbMath0726.68043OpenAlexW2071634314MaRDI QIDQ3348421

Xin He

Publication date: 1991

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(91)90012-n

zbMATH Keywords

series parallel graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)

Related Items

Improved parallel depth-first search in undirected planar graphs ⋮ An optimal parallel algorithm for planar cycle separators ⋮ Deciding whether graph \(G\) has page number one is in NC ⋮ Efficiently parallelizable problems on a class of decomposable graphs