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]
@article{AkridaGMS17,
title = {The Complexity of Optimal Design of Temporally Connected Graphs},
author = {Eleni C. Akrida and Leszek Gasieniec and George B. Mertzios and Paul G. Spirakis},
year = {2017},
doi = {10.1007/s00224-017-9757-x},
url = {https://doi.org/10.1007/s00224-017-9757-x},
researchr = {https://researchr.org/publication/AkridaGMS17},
cites = {0},
citedby = {0},
journal = {Theory Comput. Syst.},
volume = {61},
number = {3},
pages = {907-944},
}