Cargando…
The Complexity of Optimal Design of Temporally Connected Graphs
We study the design of small cost temporally connected graphs, under various constraints. We mainly consider undirected graphs of n vertices, where each edge has an associated set of discrete availability instances (labels). A journey from vertex u to vertex v is a path from u to v where successive...
| Autores principales: | , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer US
2017
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6979514/ https://www.ncbi.nlm.nih.gov/pubmed/32025196 http://dx.doi.org/10.1007/s00224-017-9757-x |