On sparse subgraphs preserving connectivity properties
From MaRDI portal
Publication:4201383
DOI10.1002/jgt.3190170302zbMath0788.05061MaRDI QIDQ4201383
Toshihide Ibaraki, Hiroshi Nagamochi, András Frank
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
05C40: Connectivity
Related Items
Graph connectivity and its augmentation: Applications of MA orderings, Sparse connectivity certificates via MA orderings in graphs, A linear time algorithm for computing 3-edge-connected components in a multigraph, On mixed connectivity certificates, Minimum cost source location problem with vertex-connectivity requirements in digraphs, Sparse graph certificates for mixed connectivity, Implementing an efficient minimum capacity cut algorithm, Existence of vertices of local connectivity \(k\) in digraphs of large outdegree, Sparse certificates and removable cycles in \(l\)-mixed \(p\)-connected graphs, Linear time algorithms for graph search and connectivity determination on complement graphs.
Cites Work