Increasing the Minimum Degree of a Graph by Contractions.
Petr A. GolovachMarcin KaminskiDaniël PaulusmaDimitrios M. ThilikosPublished in: IPEC (2011)
Keyphrases
- spanning tree
- graph representation
- graph theory
- random graphs
- structured data
- directed graph
- graph structure
- dominating set
- constant factor
- graph model
- connected dominating set
- data sets
- graph structures
- weighted graph
- directed acyclic graph
- bipartite graph
- graph partitioning
- graph matching
- graph theoretic
- clustering coefficient
- stable set
- data mining
- power law
- np complete
- np hard
- genetic algorithm
- dependency graph
- minimum cut
- neural network