Disjoint (s, t)‐cuts in a network

DOI10.1002/net.3230200402zbMath0744.90093OpenAlexW1968907718MaRDI QIDQ4712978

Donald K. Wagner

Publication date: 25 June 1992

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230200402

zbMATH Keywords

polynomial algorithmedge weighted graphpairwise disjoint edge-cutstransshipment formulation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (11)

On the \(k\)-cut subgraph polytope ⋮ A note on the problem of \(r\) disjoint \((s, t)\)-cuts and some related issues ⋮ Network reliability: Heading out on the highway ⋮ Minimum \(d\)-blockers and \(d\)-transversals in graphs ⋮ Approximation algorithms for \(k\)-hurdle problems ⋮ On short paths interdiction problems: Total and node-wise limited interdiction ⋮ Combinatorial aspects of network reliability ⋮ Blocking optimal structures ⋮ A polynomial-time simplex method for the maximum \(k\)-flow problem ⋮ Approximation Algorithms for k-Hurdle Problems ⋮ Network reliability: Numbers or insight? (A discussion paper)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Class Of Abelian Groups

This page was built for publication: Disjoint (s, t)‐cuts in a network