I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs.
Alka BhushanSajith GopalanPublished in: Theor. Comput. Sci. (2015)
Keyphrases
- undirected graph
- minimum cut
- min cut
- maximum flow
- directed graph
- directed acyclic graph
- approximation algorithms
- spanning tree
- graph cuts
- weighted graph
- shortest path problem
- connected components
- minimum cost
- graph structure
- complex networks
- shortest path
- random walk
- binary images
- edge weights
- normalized cut
- adjacency matrix
- higher order
- np hard
- bayesian networks
- multimedia data
- graph partitioning