Login / Signup

Graph Layout Problems Parameterized by Vertex Cover.

Michael R. FellowsDaniel LokshtanovNeeldhara MisraFrances A. RosamondSaket Saurabh
Published in: ISAAC (2008)
Keyphrases
  • vertex cover
  • approximation algorithms
  • planar graphs
  • computational complexity
  • optimization problems
  • np complete
  • partial order
  • precedence constraints
  • polynomial time approximation
  • graph layout