Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs Original Research Article

Many NP-complete problems on planar graphs are “fixed-parameter tractable:” Recent theoretical work provided tree decomposition-based fixed-parameter algorithms exactly solving various parameterized problems on planar graphs, among others VERTEX COVER, in time image. Here, image is some constant depending on the graph problem to be solved, image is the number of graph vertices, and image is the problem parameter (for VERTEX COVER this is the size of the vertex cover).