A carregar...
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...
Na minha lista:
| Publicado no: | Theory Comput Syst |
|---|---|
| Main Authors: | , , , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Springer US
2017
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.gov/pmc/articles/PMC6979514/ https://ncbi.nlm.nih.gov/pubmed/32025196 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/s00224-017-9757-x |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|