Searching for "Efficient Exact Algorithms on Planar Graphs Exploiting Sphere Cut Branch Decompositions." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions
by Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, V. Fomin — 2005 — in Proceedings of the 13th Annual European Symposium on Algorithms (ESA 2005
… Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions ? Frederic…
Cited by 18 (11 self) – Add To MetaCart

Designing Subexponential Algorithms: Problems, Techniques & Structures
by Frederic Dorn — 2007
…. Fomin, Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions, submitted…
Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB