A minimum degree condition forcing complete graph immersion.
Matt DeVosZdenek DvorákJacob FoxJessica McDonaldBojan MoharDiego ScheidePublished in: Comb. (2014)
Keyphrases
- spanning tree
- virtual reality
- graph structure
- graph theory
- random walk
- edge disjoint
- dominating set
- graph representation
- sufficient conditions
- random graphs
- minimum spanning tree
- minimum cost
- graph matching
- stable set
- minimum cut
- graph theoretic
- graph partitioning
- augmented reality
- directed graph
- undirected graph
- graph databases
- graph cuts
- directed acyclic graph
- structured data
- graph search
- constant factor
- planar graphs
- bipartite graph
- degree distribution
- graph properties
- bayesian networks
- genetic algorithm