Login / Signup
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions.
Frederic Dorn
Eelko Penninkx
Hans L. Bodlaender
Fedor V. Fomin
Published in:
ESA (2005)
Keyphrases
</>
planar graphs
exact algorithms
knapsack problem
exact solution
lower bound