A paradigm for listing \((s,t)\)-cuts in graphs
From MaRDI portal
Publication:1911466
zbMath0843.68039MaRDI QIDQ1911466
J. Scott Provan, Douglas R. Shier
Publication date: 13 August 1996
Published in: Algorithmica (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Related Items (13)
An inverse problem of the weighted shortest path problem ⋮ Minimum Cuts and Sparsification in Hypergraphs ⋮ Enumerating disjunctions and conjunctions of paths and cuts in reliability theory ⋮ Algebraic methods applied to shortest path and maximum flow problems in stochastic networks ⋮ Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming ⋮ Listing Maximal Subgraphs Satisfying Strongly Accessible Properties ⋮ On enumerating minimal dicuts and strongly connected subgraphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An efficient network flow code for finding all minimum cost \(s-t\) cutsets ⋮ Resilient capacity-aware routing ⋮ Extracting maximal information about sets of minimum cuts ⋮ Efficient enumeration of the vertices of polyhedra associated with network LP's
This page was built for publication: A paradigm for listing \((s,t)\)-cuts in graphs
