文章基本信息

标题：Multistage Vertex Cover
本地全文：下载
作者：Till Fluschnik ; Rolf Niedermeier ; Valentin Rohm 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2019
卷号：148
页码：1-14
DOI：10.4230/LIPIcs.IPEC.2019.14
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：Covering all edges of a graph by a small number of vertices, this is the NP-hard Vertex Cover problem, is among the most fundamental algorithmic tasks. Following a recent trend in studying dynamic and temporal graphs, we initiate the study of Multistage Vertex Cover. Herein, having a series of graphs with same vertex set but over time changing edge sets (known as temporal graph consisting of time layers), the goal is to find for each layer of the temporal graph a small vertex cover and to guarantee that the two vertex cover sets between two subsequent layers differ not too much (specified by a given parameter). We show that, different from classic Vertex Cover and some other dynamic or temporal variants of it, Multistage Vertex Cover is computationally hard even in fairly restricted settings. On the positive side, however, we also spot several fixed-parameter tractability results based on some of the most natural parameterizations.
关键词：NP-hardness; dynamic graph problems; temporal graphs; time-evolving networks; W[1]-hardness; fixed-parameter tractability; kernelization