The Complexity of Temporal Vertex Cover in Small-Degree Graphs Unveiled

Temporal Vertex Cover complexity on sparse graphs is NP-hard, contrasting with polynomial-time solutions for TVC.