Login / Signup

-approximation for finding maximum planar induced subgraphs.

Luérbio FariaCelina M. H. de FigueiredoSylvain GravierCandido F. X. MendonçaJorge Stolfi
Published in: Electron. Notes Discret. Math. (2004)
Keyphrases
  • data structure
  • maximum clique
  • relative error
  • learning algorithm
  • objective function
  • error bounds
  • maximum number
  • curved surfaces
  • approximation error
  • absolute error