"The Complexity of Optimal Design of Temporally Connected Graphs."

Eleni C. Akrida et al. (2017)

> Home

Details and statistics

DOI: 10.1007/S00224-017-9757-X

access: open

type: Journal Article

metadata version: 2020-03-27

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/mst/AkridaGMS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/AkridaGMS17
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)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.