An O(n log n) Algorithm for Maximum st-Flow in a Directed Planar Graph¶
Borradaile, G., & Klein, P. N. (2009). An O(n log n) Algorithm for Maximum st-Flow in a Directed Planar Graph. ACM.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Graph Duality
- On a planar graph, the path↔cut correspondence turns that minimum cut into a shortest path in the dual graph, which can be computed in \(O(n \log n)\) time
This sourceThe O(n log n) algorithm for maximum st-flow in a directed planar graph, which starts from shortest-path distances in the dual.
Supported in partVerified against the source
- On a planar graph, the path↔cut correspondence turns that minimum cut into a shortest path in the dual graph, which can be computed in \(O(n \log n)\) time
Verification¶
Does it exist? Not checked yet. This work's DOI is recorded above but has not been resolved against an external catalogue, so nothing here confirms the work exists.
Does it back the claim? Read against the text for 1 of 1 citation: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:f177fc3f30a6 · see in the full table