Approximate Maximum Flow on Separable Undirected Graphs
Gary L. MillerRichard PengPublished in: CoRR (2012)
Keyphrases
- maximum flow
- directed graph
- undirected graph
- minimum cut
- random walk
- directed acyclic graph
- disjoint paths
- graph structure
- min cut max flow
- spanning tree
- strongly connected
- push relabel
- random graphs
- adjacency matrix
- flow network
- shortest path problem
- vertex set
- social networks
- approximation algorithms
- connected components
- complex networks
- markov chain