Skip to Main content Skip to Navigation
Conference papers

Forte ∆-connexité dans les flots de liens

Abstract : Link streams model temporal interactions. They are composed of pairs (t, uv), representing a link between vertices u and v at time t. The question of connectivity is harder for link streams than for graphs, because the accessibility relation is not transitive. We study the notion of strongly ∆-connected component in link streams (or evolving graphs). The exact computation of strongly ∆-connected components being NP-hard, we propose an algorithm that gives upper and lower bounds for the size of the largest component.
Complete list of metadatas

Cited literature [6 references]  Display  Hide  Download
Contributor : Clémence Magnien <>
Submitted on : Wednesday, April 20, 2016 - 5:21:23 PM
Last modification on : Thursday, April 30, 2020 - 10:12:02 AM
Long-term archiving on: : Tuesday, November 15, 2016 - 7:31:06 AM


Files produced by the author(s)


  • HAL Id : hal-01305128, version 1


Charles Huyghues-Despointes, Binh-Minh Bui-Xuan, Clémence Magnien. Forte ∆-connexité dans les flots de liens. ALGOTEL 2016 - 18èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2016, Bayonne, France. ⟨hal-01305128⟩



Record views


Files downloads