Sweeping graphs with large clique number.

Boting Yang Danny Dyer Brian Alspach

Published in: Discret. Math. (2009)

Keyphrases

small number
maximum number
databases
search algorithm
computational complexity
lower bound
special case
graph cuts
directed graph
fixed number
graph theoretic