#### Filter Results:

- Full text PDF available (3)

#### Publication Year

2011

2016

- This year (0)
- Last 5 years (4)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- David Ilcinkas, Ahmed Mouhamadou Wade
- Theory of Computing Systems
- 2013

In this paper, we study the T-interval-connected dynamic graphs from the point of view of the time necessary and sufficient for their exploration by a mobile entity (agent). A dynamic graph (more precisely, an evolving graph) is T-interval-connected (T ≥ 1) if, for every window of T consecutive time steps, there exists a connected spanning subgraph that is… (More)

- David Ilcinkas, Ahmed Mouhamadou Wade
- OPODIS
- 2011

We study the problem of exploration by a mobile entity (agent) of a class of dynamic networks, namely the periodically-varying graphs (the PV-graphs, modeling public transportation systems, among others). These are defined by a set of carriers following infinitely their prescribed route along the stations of the network. Flocchini, Mans, and Santoro [FMS09]… (More)

- David Ilcinkas, Ralf Klasing, Ahmed Mouhamadou Wade
- SIROCCO
- 2014

We study the problem of exploration by a mobile entity (agent) of a class of dynamic networks, namely constantly connected dynamic graphs. This problem has already been studied in the case where the agent knows the dynamics of the graph and the underlying graph is a ring of n vertices [5]. In this paper, we consider the same problem and we suppose that the… (More)

- Bertrand Ducourthial, Ahmed Mouhamadou Wade
- Ad Hoc Networks
- 2016

- ‹
- 1
- ›