The Complexity of Optimal Design of Temporally Connected Graphs. (2017)

First Author: Akrida EC
Attributed to:  Algorithmic Aspects of Intersection Graph Models funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1007/s00224-017-9757-x

PubMed Identifier: 32025196

Publication URI: http://europepmc.org/abstract/MED/32025196

Type: Journal Article/Review

Volume: 61

Parent Publication: Theory of computing systems

Issue: 3