Login / Signup

New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k -Disjoint Cycles on Plane and Planar Graphs.

Ton KloksChuan-Min LeeJiping Liu
Published in: WG (2002)
Keyphrases
  • planar graphs
  • computational complexity
  • problems in computer vision
  • worst case
  • point correspondences
  • upper and lower bounds
  • vertex set