Parameterized algorithm for eternal vertex cover

In this paper we initiate the study of a “dynamic” variant of the classical Vertex Cover problem, the Eternal Vertex Cover problem introduced by Klostermeyer and Mynhardt, from the perspective of parameterized algorithms. This problem consists in placing a minimum number of guards on the vertices of...

Full description

Saved in:

Bibliographic Details
Published in:	Information processing letters Vol. 110; no. 16; pp. 702 - 706
Main Authors:	Fomin, Fedor V., Gaspers, Serge, Golovach, Petr A., Kratsch, Dieter, Saurabh, Saket
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 31.07.2010 Elsevier Elsevier Sequoia S.A
Subjects:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Approximation Approximations and expansions Computer science; control theory; systems Dynamic tests Eternal vertex cover Exact sciences and technology Fixed parameter tractability Graph algorithms Graphs Guards Information processing Information retrieval. Graph Kernels Mathematical analysis Mathematics Miscellaneous Parameterized complexity Placing Running Sciences and techniques of general use Studies Theoretical computing Vertex cover Vertex cover Graph algorithms Parameterized complexity Eternal vertex cover Fixed parameter tractability Vertex Edge(graph) Computer theory Polynomial approximation Approximation algorithm Complexity Polynomial time Response Input Information processing Algorithm analysis Graph algorithm
ISSN:	0020-0190, 1872-6119
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!