Counterexamples for Directed and Node Capacitated Cut-Trees
From MaRDI portal
Publication:4842118
DOI10.1137/S0097539792236730zbMath0833.90038WikidataQ124829161 ScholiaQ124829161MaRDI QIDQ4842118
Publication date: 18 March 1996
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Related Items (11)
On Element-Connectivity Preserving Graph Simplification ⋮ Flow equivalent trees in undirected node-edge-capacitated planar graphs ⋮ Tight Bounds for Gomory-Hu-like Cut Counting ⋮ Flow trees for vertex-capacitated networks ⋮ Efficient Algorithm for Computing All Low s-t Edge Connectivities in Directed Graphs ⋮ Empirical study on sufficient numbers of minimum cuts in strongly connected directed random graphs ⋮ Strong Connectivity in Directed Graphs under Failures, with Applications ⋮ Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs ⋮ Revisiting parametric multi-terminal problems: maximum flows, minimum cuts and cut-tree computations ⋮ Greedy splitting algorithms for approximating multiway partition problems ⋮ Faster algorithms for shortest path and network flow based on graph decomposition
This page was built for publication: Counterexamples for Directed and Node Capacitated Cut-Trees
