Enumerating maximal cliques in link streams with durations

DOI10.1016/j.ipl.2018.01.006zbMath1426.68227arXiv1712.06970OpenAlexW2963281929MaRDI QIDQ1705705

Matthieu Latapy, Clémence Magnien, Tiphaine Viard

Publication date: 16 March 2018

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1712.06970

zbMATH Keywords

graph algorithmscliquestemporal networkstime-varying graphslink streams

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Online algorithms; streaming algorithms (68W27)

Related Items (15)

Edge-Disjoint Branchings in Temporal Graphs ⋮ Mengerian temporal graphs revisited ⋮ Mengerian graphs: characterization and recognition ⋮ Multistage \(s-t\) path: confronting similarity with dissimilarity ⋮ Enumerating maximal cliques in link streams with durations ⋮ The Complexity of Finding Small Separators in Temporal Graphs ⋮ Graph signatures: identification and optimization ⋮ Finding Temporal Paths Under Waiting Time Constraints. ⋮ Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs ⋮ Unnamed Item ⋮ Robustness: a new form of heredity motivated by dynamic networks ⋮ The complexity of finding temporal separators under waiting time constraints ⋮ cliques ⋮ Cluster Editing in Multi-Layer and Temporal Graphs. ⋮ Königsberg sightseeing: Eulerian walks in temporal graphs

Uses Software

• Algorithm 457

Cites Work

• The worst-case time complexity for generating all maximal cliques and computational experiments
• Computing maximal cliques in link streams
• What's in a crowd? Analysis of face-to-face behavioral networks
• Enumerating maximal cliques in link streams with durations
• Listing All Maximal Cliques in Large Sparse Real-World Graphs
• An Analysis of Some Graph Theoretical Cluster Techniques
• Algorithm 457: finding all cliques of an undirected graph

This page was built for publication: Enumerating maximal cliques in link streams with durations