Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms

Author： Koutsonas Athanassios Thilikos Dimitrios

ISSN： 0178-4617

Source： Algorithmica, Vol.60, Iss.4, 2011-08, pp. : 987-1003

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

On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms

By Fomin Fedor Gaspers Serge Pyatkin Artem Razgon Igor

Algorithmica, Vol. 52, Iss. 2, 2008-10 ,pp. : 293-307

Springer Publishing Company

Access to resources Recommend Favorite

Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem

By Kratsch Stefan Neumann Frank

Algorithmica, Vol. 65, Iss. 4, 2013-04 ,pp. : 754-771

Springer Publishing Company

Access to resources Recommend Favorite

On the existence of subexponential parameterized algorithms

By Cai L. Juedes D.

Journal of Computer and System Sciences, Vol. 67, Iss. 4, 2003-12 ,pp. : 789-807

Elsevier

Access to resources Recommend Favorite

Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms

By Chen J. Kanj I.A.

Journal of Computer and System Sciences, Vol. 67, Iss. 4, 2003-12 ,pp. : 833-847

Elsevier

Access to resources Recommend Favorite

The Power of Priority Algorithms for Facility Location and Set Cover

By Angelopoulos Spyros Borodin Allan

Algorithmica, Vol. 40, Iss. 4, 2004-09 ,pp. : 271-291

Springer Publishing Company

Access to resources Recommend Favorite