Login / Signup

Efficient algorithms for decomposing graphs under degree constraints.

Cristina BazganZsolt TuzaDaniel Vanderpooten
Published in: Discret. Appl. Math. (2007)
Keyphrases
  • constraint satisfaction
  • random graphs
  • data sets
  • knowledge base
  • lower bound
  • constraint programming
  • graph matching
  • global constraints
  • graph theoretic