Login / Signup

H-coloring degree-bounded (acyclic) digraphs.

Pavol HellAurosish Mishra
Published in: Theor. Comput. Sci. (2014)
Keyphrases
  • np hard
  • directed graph
  • bounded treewidth
  • np complete
  • neural network
  • knowledge base
  • probabilistic model
  • database schemes
  • conflict free
  • causal ordering