Title of article
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs Original Research Article
Author/Authors
Jochen Alber، نويسنده , , Frederic Dorn، نويسنده , , Rolf Niedermeier، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
13
From page
219
To page
231
Abstract
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).
Keywords
Vertex Cover , Algorithm engineering , exact algorihms , Planar graphs , tree decomposition of graphs , fixed-parameter tractability
Journal title
Discrete Applied Mathematics
Serial Year
2005
Journal title
Discrete Applied Mathematics
Record number
886005
Link To Document