Optimal parallel algorithm for finding \(st\)-ambitus of a planar biconnected graph

zbMath0840.68056MaRDI QIDQ1908264

Yanyan Li

Publication date: 27 June 1996

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

graph algorithmsbridgesbiconnected graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (1)

Optimal parallel algorithms for path problems on planar graphs

This page was built for publication: Optimal parallel algorithm for finding \(st\)-ambitus of a planar biconnected graph