Efficiently Testing T -Interval Connectivity in Dynamic Graphs

@article{Casteigts2015EfficientlyTT,
  title={Efficiently Testing T -Interval Connectivity in Dynamic Graphs},
  author={Arnaud Casteigts and Ralf Klasing and Yessin M. Neggaz and Joseph G. Peters},
  journal={ArXiv},
  year={2015},
  volume={abs/1502.00089}
}
Many types of dynamic networks are made up of durable entities whose links evolve over time. When considered from a global and discrete standpoint, these networks are often modelled as evolving graphs, i.e. a sequence of static graphs $$\mathcal{{G}}=\{G_1,G_2,...,G_{\delta }\}$$ such that $$G_i=V,E_i$$ represents the network topology at time step $$i$$. Such a sequence is said to be $$T$$-interval connected if for any $$t\in [1, \delta -T+1]$$ all graphs in $$\{G_t,G_{t+1},...,G_{t+T-1… 
Computing Parameters of Sequence-Based Dynamic Graphs
TLDR
The framework allows us to compute different parameters of dynamic graphs using a common high-level strategy by using composition and test operations that are specific to the parameter, and the resulting algorithms are optimal in the sense that they use only O(δ)$O(\delta )$ composition andTest operations, where δ$\delta $ is the length of the sequence.
An Efficient Updation Approach for Enumerating Maximal $(\Delta, \gamma)$\mbox{-}Cliques of a Temporal Network
TLDR
This paper studies the maximal $(\Delta, \gamma)$\mbox{-}clique enumeration problem in online setting; i.e.; the entire link set of the network is not known in advance, and the links are coming as a batch in an iterative manner.
A Generic Framework for Computing Parameters of Sequence-Based Dynamic Graphs
TLDR
This paper generalizes the framework for computing T-interval connectivity of dynamic graphs to use various composition and test operations, which allows us to compute other parameters using the same high-level strategy that was used for T- Interval connectivity.
Automatic classification of dynamic graphs
TLDR
This work provides strategies for testing membership of a dynamic graph to a given class and a generic framework to test properties in dynamic graphs, and attempts to understand what can still be done in a context where no property on the graph is guaranteed through the distributed problem of maintaining a spanning forest in highly dynamic graphs.
A study of connectivity on dynamic graphs: computing persistent connected components
TLDR
The first objective of this work is to extend the notion of connected component to dynamic graphs in a new way and develop an algorithm computing the largest, in terms of size and length, persistent connected components in a dynamic graph.
Temporal Property Testing in Dynamic Networks: Application to Software-Defined Vehicular Networks
  • Y. Neggaz, Soufian Toufga
  • Computer Science
    2018 IEEE 27th International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises (WETICE)
  • 2018
TLDR
This paper focuses on testing temporal properties in dynamic networks, then considers SDVN – Software-Defined vehicular networks as a case study where it is proposed the integration of a new component inSDVN architecture based on a framework that allows dynamic networks properties analysis and adaptation to a given dynamic context.
Rastros de contatos e grafos dinâmicos
TLDR
This work shows theoretically and by simulation how to choose all three components for three mobility models mentioned above on the situation of low density of mobile units, called DTNs (Delay Tolerant Networks).
Tester efficacement la T-intervalle connexité dans les graphes dynamiques
Beaucoup de reseaux dynamiques sont constitues d'entites durables dont les liens evoluent a travers le temps. D'un point de vue global et discret, ces reseaux se modelisent bien sous forme d'un
Finding Structure in Dynamic Networks
TLDR
This document is the first part of the author's habilitation thesis, and it is hoped it can serve as a broad introduction to the domain of highly dynamic networks, with a focus on temporal graph concepts and their interaction with distributed computing.
Détection de composantes connexes persistantes non dominées dans un graphe dynamique
Ce travail s'interesse au probleme de connexite dans un graphe dynamique. Si cette question est assez triviale dans un graphe statique, elle ne l'est pas autant lorsque le graphe varie au cours du
...
...

References

SHOWING 1-10 OF 26 REFERENCES
Testing Temporal Connectivity in Sparse Dynamic Graphs
TLDR
The problem of testing whether a given dynamic graph is temporally connected, where the topology is given as an evolving graph whose set of vertices is invariant and the set of (directed) edges varies over time, is addressed.
DMVP: Foremost Waypoint Coverage of Time-Varying Graphs
TLDR
Recent formulations of time-varying graphs (TVGs) are applied to DMVP, shedding new light on the computational hierarchy of TVG classes by analyzing them in the context of graph navigation.
Computing maximal cliques in link streams
Temporal reachability graphs
TLDR
The notion of temporal reachability graphs, a time-varying directed graph derived from an existing connectivity graph, is introduced and an algorithm is proposed for their efficient computation.
Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks
TLDR
A theoretical framework dedicated to the study of assumptions in dynamic networks, where the connectivity is expected to change, predictably or not, during the execution, and the possibility to compare distributed algorithms on the basis of their topological requirements is offered.
Time-varying graphs and dynamic networks
TLDR
The main contribution of this paper is to review and integrate the collection of these concepts, formalisms, and related results found in the literature into a unified coherent framework, called TVG (for timevarying graphs).
Distributed computation in dynamic networks
TLDR
A worst-case model in which the communication links for each round are chosen by an adversary, and nodes do not know who their neighbors for the current round are before they broadcast their messages is considered.
Shortest, Fastest, and Foremost Broadcast in Dynamic Networks
TLDR
This paper studies the distributed counterparts of these problems, i.e. shortest, fastest, and foremost broadcast with termination detection (TDB) with minimal knowledge on the topology, through identifying three classes of dynamic graphs wherein the problems become gradually feasible.
Dynamic graph models
Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems
TLDR
A new measure of time complexity in time-varying graph in order to allow fair comparison between algorithms and takes account of communication delays attributable to dynamicity of the graph and not to the algorithms.
...
...