The Complexity of Optimal Design of Temporally Connected Graphs

Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis. The Complexity of Optimal Design of Temporally Connected Graphs. Theory Comput. Syst., 61(3):907-944, 2017. [doi]