The Complexity of Optimal Design of Temporally Connected Graphs

Eleni C. Akrida, Leszek Gąsieniec, George B. Mertzios, Paul G. Spirakis

Research output: Contribution to journalArticlepeer-review

23 Scopus citations

Fingerprint

Dive into the research topics of 'The Complexity of Optimal Design of Temporally Connected Graphs'. Together they form a unique fingerprint.

Mathematics