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

Frederic Dorn, Eelko Penninkx, Hans Leo Bodlaender, Fedor V. Fomin. Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions. In Gerth Stølting Brodal, Stefano Leonardi, editors, Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings. Volume 3669 of Lecture Notes in Computer Science, pages 95-106, Springer, 2005. [doi]

Abstract

Abstract is missing.