Constructions of hamiltonian graphs with bounded degree and diameter O (log n)

Aleksandar Ilic Dragan Stevanovic

Published in: CoRR (2011)

Keyphrases

bounded degree
graph theoretic
bounded treewidth
worst case
lower bound
domain knowledge
graph coloring
average degree
database
simulated annealing
optimization problems
logic programming
graph matching
graph databases