scientific article

zbMath0763.90084MaRDI QIDQ4008192

Ladislav Janiga, Václav Koubek

Publication date: 27 September 1992

Full work available at URL: https://eudml.org/doc/28125

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

minimum cutplanar directed network

Mathematics Subject Classification ID

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

Related Items

Minimum Cuts in Surface Graphs, Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths, Counting and sampling minimum \((s,t)\)-cuts in weighted planar graphs in polynomial time, Unnamed Item, A note on finding minimum cuts in directed planar networks by parallel computations

Cites Work

• A note on two problems in connexion with graphs
• A note on finding minimum cuts in directed planar networks by parallel computations
• Trans-dichotomous algorithms for minimum spanning trees and shortest paths
• An $O(n\log ^2 n)$ Algorithm for Maximum Flow in Undirected Planar Networks
• Maximum Flow in Planar Networks
• Efficient Planarity Testing
• Design and implementation of an efficient priority queue
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item