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

DOI10.1016/0020-0190(85)90036-5MaRDI QIDQ1069429zbMATHOpenAlexFDO

Authors 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

parallel algorithmminimum cutgeneral planar networks

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 60387
• scientific article; zbMATH DE number 742961
• Minimum flows in directed \(s\)-\(t\) planar networks
• scientific article; zbMATH DE number 2075842
• scientific article; zbMATH DE number 6850341

Cites work

• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 60387 (Why is no real title available?)
• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• Maximum Flow in Planar Networks
• Parallel Algorithms in Graph Theory: Planarity Testing

Cited in

(5)

• scientific article; zbMATH DE number 60387 (Why is no real title available?)
• scientific article; zbMATH DE number 6850341 (Why is no real title available?)
• A parallel algorithm for finding minimum cutsets in reducible graphs
• Min Cut is NP-complete for edge weighted trees
• scientific article; zbMATH DE number 2075842 (Why is no real title available?)

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

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