Minimum Temporal Spanners in Happy Graphs

TL;DR

This paper proves NP-hardness of finding minimum temporal spanners in happy graphs, a restricted class of temporal graphs, and explores parameterized complexity results.

Contribution

It establishes NP-hardness for minimum temporal spanners even in simple, proper graphs, and provides the first polynomial-time solution for graphs with a constant-size vertex cover.

Findings

NP-hardness holds even for simple, proper (happy) graphs.

Polynomial-time algorithm for graphs with constant-size vertex cover.

W[1]-hardness in non-happy graphs parameterized by feedback vertex number.

Abstract

Temporal graphs have edge sets that change over discrete time steps. Such graphs are temporally connected (TC) if all pairs of vertices can reach each other using paths that traverse the edges in a time-respecting way (temporal paths). Given a TC temporal graph it, a natural question is to find a minimum spanning subgraph of it that preserves temporal connectivity. These structures, known as temporal spanners, are fundamental and their properties (especially size) have been studied thoroughly in the past decade. In particular, the problem of minimizing the size of a temporal spanner is known to be hard. However, the existing results establish hardness for several incomparable settings and versions of the problem. In this article, we unify and strengthen these results by showing that this problem is NP-hard even on temporal graphs that are simple and proper (also known as "happy"), i.e., where every edge appears only one time, and a vertex cannot be incident to several edges simultaneously. Proving hardness in this extremely restricted setting implies, at once, that the problem is NP-hard for all the previously considered settings and versions of the problem, resolving Open Question 4 in [Casteigts et al. TCS, 2024]. We also initiate the parameterized study of this problem, showing that in the happy setting, the problem can be solved in polynomial time if the underlying graph has a constant-size vertex cover, this result being actually the first positive result on temporal spanners in general. We also show that in the non-happy setting, the problem is W[1]-hard when parameterized by the feedback vertex number of the underlying graph.