Increasing the minimum degree of a graph by contractions.
Petr A. GolovachMarcin KaminskiDaniël PaulusmaDimitrios M. ThilikosPublished in: Theor. Comput. Sci. (2013)
Keyphrases
- spanning tree
- graph structure
- connected dominating set
- dominating set
- graph theory
- connected components
- directed graph
- pairwise
- edge disjoint
- random graphs
- graph theoretic
- graph representation
- graph partitioning
- minimum cost
- directed acyclic graph
- graph matching
- structured data
- graph databases
- graph model
- weighted graph
- graph structures
- constant factor
- graph based algorithm
- minimum cut
- stable set
- min sum
- random walk
- probabilistic model
- neural network