The Complexity of Temporal Vertex Cover in Small-Degree Graphs


  • Thekla Hamm TU Wien
  • Nina Klobas Durham University
  • George B. Mertzios Durham University
  • Paul G. Spirakis University of Liverpool CEID



Search And Optimization (SO), Planning, Routing, And Scheduling (PRS)


Temporal graphs naturally model graphs whose underlying topology changes over time. Recently, the problems Temporal Vertex Cover (or TVC) and Sliding-Window Temporal Vertex Cover (or Delta-TVC for time-windows of a fixed-length Delta) have been established as natural extensions of the classic Vertex Cover problem on static graphs with connections to areas such as surveillance in sensor networks. In this paper we initiate a systematic study of the complexity of TVC and Delta-TVC on sparse graphs. Our main result shows that for every Delta geq 2, Delta-TVC is NP-hard even when the underlying topology is described by a path or a cycle. This resolves an open problem from literature and shows a surprising contrast between Delta-TVC and TVC for which we provide a polynomial-time algorithm in the same setting. To circumvent this hardness, we present a number of exact and approximation algorithms for temporal graphs whose underlying topologies are given by a path, that have bounded vertex degree in every time step, or that admit a small-sized temporal vertex cover.




How to Cite

Hamm, T., Klobas, N., Mertzios, G. B., & Spirakis, P. G. (2022). The Complexity of Temporal Vertex Cover in Small-Degree Graphs. Proceedings of the AAAI Conference on Artificial Intelligence, 36(9), 10193-10201.



AAAI Technical Track on Search and Optimization