Skip to Main content Skip to Navigation
Conference papers

Computing Temporal Twins in Time Logarithmic in History Length

Abstract : A temporal graph G is a sequence of static graphs indexed by a set of integers T representing time instants. For ∆ an integer, a pair of ∆-twins is a pair of vertices u \neg v which, starting at some time instant, have exactly the same neighbourhood outside {u, v} for ∆ consecutive instants. We address the enumeration problem of all pairs of ∆-twins in G, such that the overall runtime depends the least on the history length, namely max{t : G_t ∈ G not empty } − min{t : G_t ∈ G not empty }. We give logarithmic solutions, using red-black tree data structure. Numerical analysis of our implementation on graphs collected from real world data scales up to 10^8 history length.
Document type :
Conference papers
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : Binh-Minh Bui-Xuan Connect in order to contact the contributor
Submitted on : Tuesday, November 10, 2020 - 11:56:52 AM
Last modification on : Sunday, June 26, 2022 - 2:56:29 AM
Long-term archiving on: : Friday, February 12, 2021 - 12:16:51 PM


Files produced by the author(s)


  • HAL Id : hal-02997890, version 1


Binh-Minh Bui-Xuan, Hugo Hourcade, Cédric Miachon. Computing Temporal Twins in Time Logarithmic in History Length. Complex Networks 2020, Dec 2020, Madrid, Spain. ⟨hal-02997890⟩



Record views


Files downloads