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

DOI10.1016/0020-0190(85)90036-5zbMATH Open0583.90026OpenAlexW2075355581MaRDI QIDQ1069429FDOQ1069429

Václav Koubek, Ladislav Janiga

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)

Cites Work

• Maximum Flow in Planar Networks
• Parallel Algorithms in Graph Theory: Planarity Testing
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• Min Cut is NP-complete for edge weighted trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• A parallel algorithm for finding minimum cutsets in reducible graphs

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)