On sparse subgraphs preserving connectivity properties
From MaRDI portal
Publication:4201383
DOI10.1002/jgt.3190170302zbMath0788.05061OpenAlexW1976118519MaRDI QIDQ4201383
András Frank, Toshihide Ibaraki, Hiroshi Nagamochi
Publication date: 24 August 1993
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190170302
Related Items
A note on minimizing submodular functions, On Element-Connectivity Preserving Graph Simplification, Sparse connectivity certificates via MA orderings in graphs, Existence of vertices of local connectivity \(k\) in digraphs of large outdegree, Minimum Cuts and Sparsification in Hypergraphs, A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem, On shredders and vertex connectivity augmentation, On mixed connectivity certificates, A linear time algorithm for computing 3-edge-connected components in a multigraph, Approximating source location and star survivable network problems, Graph connectivity and its augmentation: Applications of MA orderings, Sparse certificates and removable cycles in \(l\)-mixed \(p\)-connected graphs, Sparse graph certificates for mixed connectivity, Implementing an efficient minimum capacity cut algorithm, On mixed connectivity certificates, Approximating Source Location and Star Survivable Network Problems, Linear time algorithms for graph search and connectivity determination on complement graphs., Minimum cost source location problem with vertex-connectivity requirements in digraphs
Cites Work
