Publication:4871749
From MaRDI portal
zbMath0846.05055MaRDI QIDQ4871749
Publication date: 29 September 1996
survey; connectivity; flows; trees; critical graphs; arborescences; disjoint paths; spanning trees; Menger's theorem; network flow problems; Whitney's theorem; circulations and flows; Ford-Fulkerson's algorithm; paths and reachability; paths of minimum cost
Related Items
On constructive characterizations of \((k,l)\)-sparse graphs, Partial cubes: Structures, characterizations, and constructions, Disjoint paths in symmetric digraphs, Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs, Optimal wavelength-routed multicasting, Constructive characterizations for packing and covering with trees, On one maximum multiflow problem and related metrics, Increasing digraph arc-connectivity by arc addition, reversal and complement, Disjoint paths in arborescences, Subgraphs decomposable into two trees and \(k\)-edge-connected subgraphs, The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions., Strong connectivity of polyhedral complexes, Chromatic characterization of biclique covers, A simple randomized scheme for constructing low-weight \(k\)-connected spanning subgraphs with applications to distributed algorithms, Short disjoint paths in locally connected graphs, Sparse certificates and removable cycles in \(l\)-mixed \(p\)-connected graphs, Simultaneous well-balanced orientations of graphs, On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs, Approximating Directed Weighted-Degree Constrained Networks
