Login / Signup

Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3.

Igor Razgon
Published in: J. Discrete Algorithms (2009)
Keyphrases
  • maximum independent set
  • vertex cover
  • graph theory
  • independent set
  • graph theoretic
  • planar graphs
  • approximation algorithms
  • precedence constraints
  • partial order
  • scheduling problem
  • maximum weight