Login / Signup

MSOL partitioning problems on graphs of bounded treewidth and clique-width.

Michaël Rao
Published in: Theor. Comput. Sci. (2007)
Keyphrases
  • bounded treewidth
  • np complete
  • highly parallelizable
  • decision problems
  • databases
  • graph theoretic
  • machine learning
  • decision makers
  • data integration
  • np hard
  • graph theory