NP-completeness Results for Partitioning a Graph into Total Dominating Sets.
Mikko KoivistoPetteri LaakkonenJuho LauriPublished in: COCOON (2017)
Keyphrases
- graph partitioning
- partitioning algorithm
- graph structure
- minimum cut
- random walk
- directed graph
- vertex set
- weighted graph
- structured data
- graph matching
- graph based algorithm
- maximum flow
- graph theory
- graph databases
- spectral graph
- disjoint sets
- min cut
- graph representation
- undirected graph
- search algorithm
- ranking algorithm
- graphical models
- lower bound