Partitioning a graph into minimum gap components.
Maurizio BruglieriRoberto CordonePublished in: Electron. Notes Discret. Math. (2016)
Keyphrases
- minimum cut
- graph partitioning
- partitioning algorithm
- spanning tree
- maximum flow
- graph cuts
- connected dominating set
- edge disjoint
- vertex set
- graph representation
- software components
- directed graph
- graph model
- directed acyclic graph
- weighted graph
- minimum cost
- normalized cut
- min cut
- building blocks
- connected components
- lower bound
- random walk
- spectral graph
- graph based algorithm
- constant factor
- random graphs
- graph clustering
- graph theoretic