Login / Signup

Efficiently implementing maximum independent set algorithms on circle graphs.

Nicholas NashSylvain LelaitDavid Gregg
Published in: ACM J. Exp. Algorithmics (2008)
Keyphrases
  • graph theory
  • maximum independent set
  • learning algorithm
  • theoretical analysis
  • computational complexity
  • computational cost
  • efficient implementation
  • data structure
  • highly efficient