Bidirectional edges problem. I: A simple algorithm

zbMATH Open0840.68089MaRDI QIDQ1908265FDOQ1908265

Authors: Yanyan Li 

Publication date: 26 February 1996

Published in: Algorithmica (Search for Journal in Brave)

Recommendations

• A linear algorithm for the all-bidirectional-edges problem on planar graphs
• Optimal parallel algorithms for path problems on planar graphs
• A bidirectional shortest-path algorithm with good average-case behavior
• STACS 2004
• A quick method for finding shortest pairs of disjoint paths

zbMATH Keywords

bidirectional edges problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Network design and communication in computer systems (68M10)

Cited In (1)

• A linear algorithm for the all-bidirectional-edges problem on planar graphs

This page was built for publication: Bidirectional edges problem. I: A simple algorithm

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