cliques

Enumerating maximal cliques in link streams with durations. Link streams model interactions over time, and a clique in a link stream is defined as a set of nodes and a time interval such that all pairs of nodes in this set interact permanently during this time interval. This notion was introduced recently in the case where interactions are instantaneous. We generalize it to the case of interactions with durations and show that the instantaneous case actually is a particular case of the case with durations. We propose an algorithm to detect maximal cliques that improves our previous one for instantaneous link streams, and performs better than the state of the art algorithms in several cases of interest.


References in zbMATH (referenced in 16 articles , 1 standard article )

Showing results 1 to 16 of 16.
Sorted by year (citations)

  1. Balasundaram, Balabhaskar; Borrero, Juan S.; Pan, Hao: Graph signatures: identification and optimization (2022)
  2. Akrida, Eleni C.; Mertzios, George B.; Spirakis, Paul G.; Raptopoulos, Christoforos: The temporal explorer who returns to the base (2021)
  3. Casteigts, Arnaud; Peters, Joseph G.; Schoeters, Jason: Temporal cliques admit sparse spanners (2021)
  4. Enright, Jessica; Meeks, Kitty; Mertzios, George B.; Zamaraev, Viktor: Deleting edges to restrict the size of an epidemic in temporal networks (2021)
  5. Mertzios, George B.; Molter, Hendrik; Zamaraev, Viktor: Sliding window temporal graph coloring (2021)
  6. Akrida, Eleni C.; Mertzios, George B.; Nikoletseas, Sotiris; Raptopoulos, Christoforos; Spirakis, Paul G.; Zamaraev, Viktor: How fast can we reach a target vertex in stochastic temporal graphs? (2020)
  7. Akrida, Eleni C.; Mertzios, George B.; Spirakis, Paul G.; Zamaraev, Viktor: Temporal vertex cover with a sliding time window (2020)
  8. Bai, Wen; Chen, Yadi; Wu, Di: Efficient temporal core maintenance of massive graphs (2020)
  9. Baste, Julien; Bui-Xuan, Binh-Minh; Roux, Antoine: Temporal matching (2020)
  10. Lamarche-Perrin, Robin: An information-theoretic framework for the lossy compression of link streams (2020)
  11. Zschoche, Philipp; Fluschnik, Till; Molter, Hendrik; Niedermeier, Rolf: The complexity of finding small separators in temporal graphs (2020)
  12. Casteigts, Arnaud; Klasing, Ralf; Neggaz, Yessin M.; Peters, Joseph G.: Computing parameters of sequence-based dynamic graphs (2019)
  13. Akrida, Eleni C.; Mertzios, George B.; Spirakis, Paul G.; Zamaraev, Viktor: Temporal vertex cover with a sliding time window (2018)
  14. Viard, Tiphaine; Magnien, Clémence; Latapy, Matthieu: Enumerating maximal cliques in link streams with durations (2018)
  15. Zschoche, Philipp; Fluschnik, Till; Molter, Hendrik; Niedermeier, Rolf: The complexity of finding small separators in temporal graphs (2018)
  16. Viard, Jordan; Latapy, Matthieu; Magnien, Clémence: Computing maximal cliques in link streams (2016)