Planar Strong Connectivity Helps in Parallel Depth-First Search

DOI10.1137/S0097539792227077zbMath0828.68086OpenAlexW2060759452MaRDI QIDQ4326852

Ming-Yang Kao

Publication date: 27 March 1995

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539792227077

zbMATH Keywords

planar directed graph

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99) Distributed algorithms (68W15)

Related Items (2)

An optimal parallel algorithm for planar cycle separators ⋮ Depth-first search in directed planar graphs, revisited

This page was built for publication: Planar Strong Connectivity Helps in Parallel Depth-First Search