Maximum flow in (s,t) planar networks

Hassin, R. (1981). Maximum flow in (s,t) planar networks.

Type

Journal article

Intellectual base

Primary research

Year

1981

ISSN

0020-0190

DOI

10.1016/0020-0190(81)90120-4

DOI registrant

Elsevier

Link

https://doi.org/10.1016/0020-0190(81)90120-4

Cited by

1 citation across 1 artifact.

Domain-specific

• Graph Duality
  • … table between primal and dual problems: a path between two vertices in $G$ corresponds to a cut separating the enclosing faces in $G^*$, so maximum-flow / minimum-cut problems on planar graphs reduce to shortest-path problems on their duals and admit $O(n \log n)$ algorithms unavailable for general graphs

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? Not recorded. The single citation of this work carries no recorded support check.

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:638b3128361a · see in the full table