Improving an upper bound on the size of k-regular induced subgraphs.

Published in: J. Comb. Optim. (2011)

Keyphrases

upper bound
lower bound
worst case
upper and lower bounds
branch and bound algorithm
constant factor
computational complexity
maximum clique
case study
data structure
data streams
association rules
linear functions