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

zbMATH Open0840.68056MaRDI QIDQ1908264FDOQ1908264

Authors: Yanyan Li 

Publication date: 27 June 1996

Published in: Algorithmica (Search for Journal in Brave)

Recommendations

• The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs
• Optimal parallel algorithms on planar graphs
• scientific article; zbMATH DE number 4060742
• Optimal parallel algorithms for path problems on planar graphs

zbMATH Keywords

graph algorithmsbridgesbiconnected graph

Mathematics Subject Classification ID

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

Cited In (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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908264)