Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree.

Daniela Kühn John Lapinskas Deryk Osthus

Published in: Comb. Probab. Comput. (2013)

Keyphrases

dynamic programming
worst case
spanning tree
constant factor
minimum cost
search algorithm
directed graph
graph representation
graph theory
slightly higher
minimum energy
random graphs
graph theoretic
graph structure
data sets
graph matching
optimal solution
feature selection
neural network