Login / Signup

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

Heike Ripphausen-LipaDorothea WagnerKarsten Weihe
Published in: ISAAC (1993)
Keyphrases
  • planar graphs
  • vertex cover
  • optimization problems
  • worst case
  • problems in computer vision
  • combinatorial optimization
  • computational complexity
  • pairwise
  • least squares
  • binary images
  • minimum spanning tree
  • max cut