Linear-Processor NC Algorithms for Planar Directed Graphs I: Strongly Connected Components
From MaRDI portal
Publication:4202204
DOI10.1137/0222032zbMath0773.68040OpenAlexW1998292573MaRDI QIDQ4202204
Publication date: 1 September 1993
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0222032
vertex expansionstrongly connected componentsplanar orientationplanar directed graphsedge cuttingplanar topologyvertex contractionlinear-processor NC algorithms
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99) Distributed algorithms (68W15)
Related Items (5)
On the parallel computation of the biconnected and strongly connected co-components of graphs ⋮ Depth-first search in directed planar graphs, revisited ⋮ Topologically trivial closed walks in directed surface graphs ⋮ Unnamed Item ⋮ Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs
This page was built for publication: Linear-Processor NC Algorithms for Planar Directed Graphs I: Strongly Connected Components
