Login / Signup

Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions.

Frederic DornEelko PenninkxHans L. BodlaenderFedor V. Fomin
Published in: ESA (2005)
Keyphrases
  • planar graphs
  • exact algorithms
  • knapsack problem
  • exact solution
  • lower bound