ScholarLens Back to search
2009•Unpublished venueRequires access

Parameterized VERTEX COVER in Graphs of Small Degree

Peter J. Taillon

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Vertex cover, Kernelization, Parameterized complexity, Bounded function, Degree (music), Edge cover, Vertex (graph theory), Feedback vertex set

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Parameterized VERTEX COVER in Graphs of Small Degree — Research Paper | ScholarLens