Efficiently Testing T-Interval Connectivity in Dynamic Graphs

Arnaud Casteigts; Ralf Klasing; Yessin M. Neggaz; Joseph G. Peters

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 graphs G=(G_1,G_2,...,G_δ) 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∈ [1, δ-T+1] all graphs in {G_t,G_t+1,...,G_t+T-1} share a common connected spanning subgraph. In this paper, we

more »

... er the problem of deciding whether a given sequence G is T-interval connected for a given T. We also consider the related problem of finding the largest T for which a given G is T-interval connected. We assume that the changes between two consecutive graphs are arbitrary, and that two operations, binary intersection and connectivity testing, are available to solve the problems. We show that Ω(δ) such operations are required to solve both problems, and we present optimal O(δ) online algorithms for both problems. We extend our online algorithms to a dynamic setting in which connectivity is based on the recent evolution of the network.

<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1502.00089v3">arXiv:1502.00089v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jvqzcusb6jal7nfhzn2sne4oiu">fatcat:jvqzcusb6jal7nfhzn2sne4oiu</a> </span>

<span class="ui label basic blue small">Multiple Versions</span>

<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200928095122/https://arxiv.org/pdf/1502.00089v3.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f0/14/f014a66726d4cfa8f063a09d03f4eb60e135cadf.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1502.00089v3" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Efficiently Testing T-Interval Connectivity in Dynamic Graphs [article]

Preserved Fulltext

Other Versions