Computing Temporal Twins in Time Logarithmic in History Length - Archive ouverte HAL Access content directly
Conference Papers Year : 2020

Computing Temporal Twins in Time Logarithmic in History Length

Binh-Minh Bui-Xuan
Hugo Hourcade
  • Function : Author
  • PersonId : 1081283
Cédric Miachon
  • Function : Author
  • PersonId : 1081284

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.
Fichier principal
Vignette du fichier
BHM_CN20.pdf (627.12 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02997890 , version 1 (10-11-2020)

Identifiers

  • HAL Id : hal-02997890 , version 1

Cite

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⟩
115 View
216 Download

Share

Gmail Facebook X LinkedIn More