Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions

Author： Dorn Frederic   Penninkx Eelko   Bodlaender Hans   Fomin Fedor  

Publisher： Springer Publishing Company

ISSN： 0178-4617

Source： Algorithmica, Vol.58, Iss.3, 2010-11, pp. : 790-810

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Efficient algorithms for acyclic colorings of graphs

By Chen Z.-Z.  

Theoretical Computer Science, Vol. 230, Iss. 1, 2000-01 ,pp. : 75-95

Elsevier

Access to resources Recommend Favorite

Optimal parallel algorithms for path problems on planar graphs

By Srikrishna G.   Rangan C.P.  

Theoretical Computer Science, Vol. 145, Iss. 1, 1995-07 ,pp. : 27-43

Elsevier

Access to resources Recommend Favorite

Efficient parallel algorithms for doubly convex-bipartite graphs

By Chang-Wu Y.   Gen-Huey C.  

Theoretical Computer Science, Vol. 147, Iss. 1, 1995-08 ,pp. : 249-265

Elsevier

Access to resources Recommend Favorite

Exact Algorithms for L(2,1)-Labeling of Graphs

By Havet Frédéric   Klazar Martin   Kratochvíl Jan   Kratsch Dieter   Liedloff Mathieu  

Algorithmica, Vol. 59, Iss. 2, 2011-02 ,pp. : 169-194

Springer Publishing Company

Access to resources Recommend Favorite

Linear-time algorithms for parametric minimum spanning tree problems on planar graphs

By Fernandez-Baca D.   Slutzki G.  

Theoretical Computer Science, Vol. 181, Iss. 1, 1997-07 ,pp. : 57-74

Elsevier

Access to resources Recommend Favorite