36 citations · 170 across the 60 of their papers we have counts for
Showing 2015 · cs.DMShow all
2 papers · 2 filters
cs.DM2015
The complexity of optimal design of temporally connected graphs
Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios +1
We study the design of small cost temporally connected graphs, under various constraints. We mainly consider undirected graphs of vertices, where each edge has an associated se…
cs.DM2015★ 2 cited
Temporal Network Optimization Subject to Connectivity Constraints
George B. Mertzios, Othon Michail, Paul G. Spirakis
In this work we consider \emph{temporal networks}, i.e. networks defined by a \emph{labeling} assigning to each edge of an \emph{underlying graph} a set of \emph{discrete}…