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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theory of computing systems 2017-10, Vol.61 (3), p.907-944
Hauptverfasser:	Akrida, Eleni C., Gąsieniec, Leszek, Mertzios, George B., Spirakis, Paul G.
Format:	Artikel
Sprache:	eng
Schlagworte:	Availability Computer Science Computing time Design Graph theory Graphs Labels Polynomials Proving Redundancy Theory of Computation Uranium
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!