This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 WRI World Congress on Computer Science and Information Engineering
Parameterized VERTEX COVER in Graphs of Small Degree
Los Angeles, California USA
March 31-April 02
ISBN: 978-0-7695-3507-4
We describe a new approach to improve algorithms for solving the k-Vertex Cover problem, that complements the state-of-the-art kernelization techniques based on solving maximum-flow instances. Our algorithm applies to graphs of small bounded degree, adapts existing k-vertex cover machinery, and incurs no additional complexity. We also investigate the applicability of our new algorithm to solving the Maximum Independent Set problem in graphs of small bounded degree.
Index Terms:
Algorithms, parameterized complexity, graph theory
Citation:
P.J. Taillon, "Parameterized VERTEX COVER in Graphs of Small Degree," csie, vol. 1, pp.728-732, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.