An Enumerative Perspective on Connectivity
An Enumerative Perspective on Connectivity
Connectivity (or equivalently, unweighted maximum flow) is an important measure in graph theory and combinatorial optimization. Given a graph G with vertices s and t, the connectivity λ(s,t) from s to t is defined to be the maximum number of edge-disjoint paths from s to t in G.