Improving Vertex Cover as a Graph Parameter

Parameterized algorithms are often used to efficiently solve NP-hard problems on graphs. In this context, vertex cover is used as a powerful parameter for dealing with graph problems which are hard to solve even when parameterized by tree-width; however, the drawback of vertex cover is that bounding...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete Mathematics and Theoretical Computer Science Vol. 17 no.2; no. Discrete Algorithms; pp. 77 - 100
Main Author:	Ganian, Robert
Format:	Journal Article
Language:	English
Published:	Nancy DMTCS 14.09.2015 Discrete Mathematics & Theoretical Computer Science
Subjects:	[info.info-dm] computer science [cs]/discrete mathematics [cs.dm] Analysis Computational complexity Computer Science Discrete Mathematics Graph theory Graphs Mathematics Parameter estimation parameterized complexity twin-cover vertex cover United States Twin-cover Vertex cover Parameterized Complexity
ISSN:	1365-8050, 1462-7264, 1365-8050
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!