ILCINKAS, David; WADE, Ahmed

Métadonnées

Licence d’utilisation du document

ILCINKAS, David
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]

WADE, Ahmed
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
Combinatoire et Algorithmique

Langue

Communication dans un congrès

Ce document a été publié dans

Proceedings of the 20th International Colloquium on Structural Information and Communication Complexity, Proceedings of the 20th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2013, 2013-07-01, Ischia. 2013p. to appear

Résumé en anglais

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 > 0) if, for every window of T consecutive time steps, there exists a connected spanning subgraph that is stable (always present) during this period. This property of connection stability over time was introduced by Kuhn, Lynch and Oshman (STOC 2010). We focus on the case when the underlying graph is a ring of size n, and we show that the worst-case time complexity for the exploration problem is 2n-T-Theta(1) time units if the agent knows the dynamics of the graph, and n+ n/max{1, T-1} * (delta-1) \pm Theta(delta) time units otherwise, where delta is the maximum time between two successive appearances of an edge.< Réduire

Mots clés en anglais

Exploration

Dynamic graphs

Mobile agent

T-interval-connectivity

URI

https://oskar-bordeaux.fr/handle/20.500.12278/197752

Project ANR

Calculabilité et complexité en distribué - ANR-11-BS02-0014

Origine

Importé de hal

Unités de recherche

Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800