34 citations · 50 across the 20 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
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.DM2009
More efficient periodic traversal in anonymous undirected graphs
J. Czyzowicz, S. Dobrev, L. Gasieniec +7
We consider the problem of periodic graph exploration in which a mobile entity with constant memory, an agent, has to visit all n nodes of an arbitrary undirected graph G in a peri…