An efficient network flow code for finding all minimum cost \(s-t\) cutsets

DOI10.1016/S0305-0548(00)00058-7zbMath0993.90090OpenAlexW2100534385WikidataQ126657768 ScholiaQ126657768MaRDI QIDQ5952784

Jason G. DeVinney, Norman D. Curet, Matthew E. Gaston

Publication date: 2002

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(00)00058-7

zbMATH Keywords

networkdirected graphcutset algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of graph theory (05C90)

Related Items (2)

Enumerating disjunctions and conjunctions of paths and cuts in reliability theory ⋮ On enumerating minimal dicuts and strongly connected subgraphs

Cites Work

• On implementing the push-relabel method for the maximum flow problem
• A paradigm for listing \((s,t)\)-cuts in graphs
• On the structure of all minimum cuts in a network and applications
• Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An efficient network flow code for finding all minimum cost \(s-t\) cutsets