%0 Journal Article %1 journals/mst/AkridaGMS17 %A Akrida, Eleni C. %A Gasieniec, Leszek %A Mertzios, George B. %A Spirakis, Paul G. %D 2017 %J Theory Comput. Syst. %K dblp %N 3 %P 907-944 %T The Complexity of Optimal Design of Temporally Connected Graphs. %U http://dblp.uni-trier.de/db/journals/mst/mst61.html#AkridaGMS17 %V 61

@article{journals/mst/AkridaGMS17, added-at = {2019-06-02T00:00:00.000+0200}, author = {Akrida, Eleni C. and Gasieniec, Leszek and Mertzios, George B. and Spirakis, Paul G.}, biburl = {https://www.bibsonomy.org/bibtex/2b5960418fc342863cdbfac48e8dfba13/dblp}, ee = {https://www.wikidata.org/entity/Q59613292}, interhash = {9a8aa40ee9a902c7f06eb3b946752b24}, intrahash = {b5960418fc342863cdbfac48e8dfba13}, journal = {Theory Comput. Syst.}, keywords = {dblp}, number = 3, pages = {907-944}, timestamp = {2019-06-04T12:08:11.000+0200}, title = {The Complexity of Optimal Design of Temporally Connected Graphs.}, url = {http://dblp.uni-trier.de/db/journals/mst/mst61.html#AkridaGMS17}, volume = 61, year = 2017 }