Login / Signup

Linear-Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs.

Heike Ripphausen-LipaDorothea WagnerKarsten Weihe
Published in: Int. J. Found. Comput. Sci. (1996)
Keyphrases
  • planar graphs
  • vertex cover
  • optimization problems
  • problems in computer vision
  • pairwise
  • worst case
  • np hard
  • graph theory