Login / Signup

Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms.

Eugene L. LawlerJan Karel LenstraA. H. G. Rinnooy Kan
Published in: SIAM J. Comput. (1980)
Keyphrases
  • np hardness
  • computational complexity
  • np hard
  • worst case analysis
  • worst case
  • learning algorithm
  • approximation algorithms
  • genetic algorithm
  • bayesian networks
  • average case