Login / Signup

-hardness with two-arc destruction.

Donglei DuR. Chandrasekaran
Published in: Networks (2007)
Keyphrases
  • np hard
  • computational complexity
  • phase transition
  • worst case
  • np complete
  • learning theory
  • information theoretic
  • multi class
  • database
  • genetic algorithm
  • knowledge base
  • preprocessing
  • data model
  • constraint satisfaction