Disjoint (s, t)‐cuts in a network

DOI10.1002/NET.3230200402MaRDI QIDQ4712978zbMATH OpenOpenAlexFDO

Authors 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

edge weighted graphpairwise disjoint edge-cutspolynomial algorithmtransshipment formulation

Mathematics Subject Classification ID

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

Recommendations

• On the k-cut subgraph polytope
• A linear programming formulation of Mader's edge-disjoint paths problem
• Finding disjoint paths with different path-costs: Complexity and algorithms

Cites work

• A Class Of Abelian Groups
• Graph theory with applications
• scientific article; zbMATH DE number 3121293 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)

Cited in

(16)

• Combinatorial aspects of network reliability
• On the k-cut subgraph polytope
• Blocking optimal structures
• A note on the problem of r disjoint (s, t)-cuts and some related issues
• A linear programming formulation of Mader's edge-disjoint paths problem
• Minimum \(d\)-blockers and \(d\)-transversals in graphs
• scientific article; zbMATH DE number 913348 (Why is no real title available?)
• Multicommodity disconnecting set problem
• Approximation Algorithms for k-Hurdle Problems
• Network reliability: Heading out on the highway
• Approximation algorithms for \(k\)-hurdle problems
• Valid cuts for the design of potential-based flow networks
• A polynomial-time simplex method for the maximum \(k\)-flow problem
• Finding diverse minimum s-t cuts
• Network reliability: Numbers or insight? (A discussion paper)
• On short paths interdiction problems: Total and node-wise limited interdiction

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

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