NP-completeness results for partitioning a graph into total dominating sets.
Mikko KoivistoPetteri LaakkonenJuho LauriPublished in: Theor. Comput. Sci. (2020)
Keyphrases
- graph clustering
- graph partitioning
- normalized cut
- bipartite graph
- weighted graph
- adjacency matrix
- edge weights
- graph model
- partitioning algorithm
- neural network
- spectral graph
- minimum cut
- graph representation
- graph structure
- directed graph
- structured data
- random walk
- markov random field
- mobile robot
- data structure
- genetic algorithm