The Community for Technology Leaders
RSS Icon
Subscribe
Los Angeles, CA
March 31, 2009 to April 2, 2009
ISBN: 978-0-7695-3507-4
pp: 728-732
ABSTRACT
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, 2009, 2009 WRI World Congress on Computer Science and Information Engineering, CSIE, 2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009, pp. 728-732, doi:10.1109/CSIE.2009.965
39 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool