Edge-disjoint Hamilton cycles in graphs.
Demetres ChristofidesDaniela KühnDeryk OsthusPublished in: J. Comb. Theory, Ser. B (2012)
Keyphrases
- edge disjoint
- spanning tree
- minimum cost
- undirected graph
- total length
- graph matching
- graph theoretic
- graph representation
- graph mining
- graph databases
- information retrieval
- series parallel
- pairwise
- graph structure
- weighted graph
- edge weights
- database
- bipartite graph
- directed graph
- pattern recognition
- feature selection
- machine learning
- data sets