scientific article; zbMATH DE number 60387

MaRDI QIDQ4008192zbMATH OpenFDO

Authors Ladislav Janiga, Václav Koubek

Publication date 27 September 1992

Full work available at URL https://eudml.org/doc/28125, http://www.kybernetika.cz/content/1992/1/37

zbMATH Keywords

minimum cutplanar directed network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• A note on finding minimum cuts in directed planar networks by parallel computations
• Minimum flows in directed s-t planar networks
• scientific article; zbMATH DE number 6850341
• scientific article; zbMATH DE number 2075842
• A Faster Algorithm for Finding the Minimum Cut in a Directed Graph

Cites work

• A note on finding minimum cuts in directed planar networks by parallel computations
• A note on two problems in connexion with graphs
• An O(n\log ^2 n) Algorithm for Maximum Flow in Undirected Planar Networks
• Design and implementation of an efficient priority queue
• Efficient Planarity Testing
• scientific article; zbMATH DE number 3887060 (Why is no real title available?)
• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• Maximum Flow in Planar Networks
• Trans-dichotomous algorithms for minimum spanning trees and shortest paths

Cited in

(16)

• A note on finding minimum cuts in directed planar networks by parallel computations
• Shortest directed networks in the plane
• Minimum cuts and shortest cycles in directed planar graphs via noncrossing shortest paths
• Minimum flows in directed s-t planar networks
• Minimum s-t cut in undirected planar graphs when the source and the sink are close
• scientific article; zbMATH DE number 3848942 (Why is no real title available?)
• Minimum flows in (s,t) planar networks
• A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
• Computing All Small Cuts in an Undirected Network
• scientific article; zbMATH DE number 6850341 (Why is no real title available?)
• Minimal graph cuts on network subgraphs
• Improved algorithms for \textsc{Min-cut} and \textsc{Max-flow} in undirected planar graphs
• scientific article; zbMATH DE number 2188469 (Why is no real title available?)
• Global minimum cuts in surface embedded graphs
• Minimum Cuts in Surface Graphs
• Counting and sampling minimum (s,t)-cuts in weighted planar graphs in polynomial time

This page was built for publication:

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