Partitioning a graph into offensive k-alliances.
José M. Sigarreta AlmiraIsmael González YeroSergio BermudoJuan Alberto Rodríguez-VelázquezPublished in: Discret. Appl. Math. (2011)
Keyphrases
- graph partitioning
- partitioning algorithm
- random walk
- graph theory
- weighted graph
- stable set
- spectral graph
- graph structure
- labeled graphs
- vertex set
- bipartite graph
- graph matching
- graph model
- minimum cut
- graph clustering
- graph theoretic
- minimum spanning tree
- normalized cut
- random graphs
- dependency graph
- graph representation
- undirected graph
- spanning tree
- structured data
- graphical models