Approximate Maximum Flow on Separable Undirected Graphs.
Gary L. MillerRichard PengPublished in: SODA (2013)
Keyphrases
- maximum flow
- directed graph
- undirected graph
- minimum cut
- random walk
- graph structure
- disjoint paths
- approximation algorithms
- directed acyclic graph
- push relabel
- strongly connected
- connected components
- adjacency matrix
- spanning tree
- complex networks
- minimum cost
- min cut max flow
- vertex set
- computer vision
- special case
- data structure