I/O Efficient Algorithms for the Minimum Cut Problem on Unweighted Undirected Graphs.
Alka BhushanSajith GopalanPublished in: WALCOM (2014)
Keyphrases
- undirected graph
- minimum cut
- min cut
- maximum flow
- directed graph
- directed acyclic graph
- weighted graph
- graph cuts
- approximation algorithms
- spanning tree
- graph structure
- shortest path problem
- minimum cost
- connected components
- complex networks
- random walk
- shortest path
- computer vision
- graph partitioning
- adjacency matrix
- np hard
- belief propagation
- edge weights