Vertex Cover Problem Parameterized Above and Below Tight Bounds

Details Vertex Cover Problem Parameterized Above and Below Tight Bounds Vertex Cover Problem Parameterized Above and Below Tight Bounds

2009-07-26

arxiv.org/abs/0907.4488v2

Computer Science

Computational Complexity

Scientific paper

We study the well-known Vertex Cover problem parameterized above and below
tight bounds. We show that two of the parameterizations (both were suggested by
Mahajan, Raman and Sikdar, J. Computer and System Sciences, 75(2):137--153,
2009) are fixed-parameter tractable and two other parameterizations are
W[1]-hard (one of them is, in fact, W[2]-hard).

Affiliated with

Also associated with

No associations

Rating

Vertex Cover Problem Parameterized Above and Below Tight Bounds does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Vertex Cover Problem Parameterized Above and Below Tight Bounds, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Vertex Cover Problem Parameterized Above and Below Tight Bounds will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-357523