A note on finding minimum cuts in directed planar networks by parallel computations

DOI10.1016/0020-0190(85)90036-5zbMath0583.90026OpenAlexW2075355581MaRDI QIDQ1069429

Ladislav Janiga, Václav Koubek

Publication date: 1985

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(85)90036-5

zbMATH Keywords

minimum cutparallel algorithmgeneral planar networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10)

Related Items (1)

Unnamed Item

Cites Work

• Maximum Flow in Planar Networks
• Parallel Algorithms in Graph Theory: Planarity Testing
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on finding minimum cuts in directed planar networks by parallel computations