Obtaining a Planar Graph by Vertex Deletion

ISSN： 0178-4617

Source： Algorithmica, Vol.62, Iss.3-4, 2012-04, pp. : 807-822

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

Proper Interval Vertex Deletion

By Hof Pim Villanger Yngve

Algorithmica, Vol. 65, Iss. 4, 2013-04 ,pp. : 845-867

Springer Publishing Company

Access to resources Recommend Favorite

Maximum Flow in Directed Planar Graphs with Vertex Capacities

By Kaplan Haim Nussbaum Yahav

Algorithmica, Vol. 61, Iss. 1, 2011-09 ,pp. : 174-189

Springer Publishing Company

Access to resources Recommend Favorite

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

By Koutsonas Athanassios Thilikos Dimitrios

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

Springer Publishing Company

Access to resources Recommend Favorite

On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems

By Fernau Henning Kuppusamy Lakshmanan Raman Indhumathi

RAIRO - Theoretical Informatics and Applications, Vol. 52, Iss. 1, 2018-07 ,pp. : 1-21

Edp Sciences

Access to resources Recommend Favorite

Approximation and Tidying—A Problem Kernel for s-Plex Cluster Vertex Deletion

By Bevern René Moser Hannes Niedermeier Rolf

Algorithmica, Vol. 62, Iss. 3-4, 2012-04 ,pp. : 930-950

Springer Publishing Company

Access to resources Recommend Favorite