Constructive Upper Bounds for Cycle-Saturated Graphs of Minimum Size.

Ronald J. Gould Tomasz Luczak John R. Schmitt

Published in: Electron. J. Comb. (2006)

Keyphrases

upper bound
constant factor
lower bound
spanning tree
maximal cliques
worst case
graph theory
tight bounds
sample size
graph matching
approximation algorithms
lower and upper bounds
pruning power
computational complexity