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]

Authors

Eleni C. Akrida

This author has not been identified. Look up 'Eleni C. Akrida' in Google

Leszek Gasieniec

This author has not been identified. Look up 'Leszek Gasieniec' in Google

George B. Mertzios

This author has not been identified. Look up 'George B. Mertzios' in Google

Paul G. Spirakis

This author has not been identified. Look up 'Paul G. Spirakis' in Google