Cover Image

Faster maximal clique enumeration in large real-world link streams

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Baudin, Alexis, Magnien, Clémence, Tabourier, Lionel
Format:	Preprint
Published:	2023
Subjects:	Data Structures and Algorithms Computational Complexity Information Retrieval Social and Information Networks
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

BBK: a simpler, faster algorithm for enumerating maximal bicliques in large sparse bipartite graphs
by: Baudin, Alexis, et al.
Published: (2024)

LSCPM: communities in massive real-world Link Streams by Clique Percolation Method
by: Baudin, Alexis, et al.
Published: (2023)

Aggregating maximal cliques in real-world graphs
by: Alon, Noga, et al.
Published: (2025)

Counting Graphlets of Size $k$ under Local Differential Privacy
by: Suppakitpaisarn, Vorapong, et al.
Published: (2025)

The Theory and Practice of Computing the Bus-Factor
by: Piccolo, Sebastiano A., et al.
Published: (2026)

Covering a Graph with Dense Subgraph Families, via Triangle-Rich Sets
by: Basu, Sabyasachi, et al.
Published: (2024)

Parallel Algorithms for Median Consensus Clustering in Complex Networks
by: Hussain, Md Taufique, et al.
Published: (2024)

Accurate and Fast Estimation of Temporal Motifs using Path Sampling
by: Pan, Yunjie, et al.
Published: (2024)

Triadic First-Order Logic Queries in Temporal Networks
by: Bhalerao, Omkar, et al.
Published: (2025)

Seed Selection in the Heterogeneous Moran Process
by: Petsinis, Petros, et al.
Published: (2024)

List Decoding Expander-Based Codes up to Capacity in Near-Linear Time
by: Srivastava, Shashank, et al.
Published: (2025)

Linear Index for Logarithmic Search-Time for any String under any Internal Node in Suffix Trees
by: Al-okaily, Anas
Published: (2024)

Tight Bounds for Noisy Computation of High-Influence Functions, Connectivity, and Threshold
by: Gu, Yuzhou, et al.
Published: (2025)

Optimality of Frequency Moment Estimation
by: Braverman, Mark, et al.
Published: (2024)

Improved Decoding of Tanner Codes
by: Zhou, Zhaienhe, et al.
Published: (2025)

An $Ω( (\log n / \log \log n)^2 )$ Cell-Probe Lower Bound for Dynamic Boolean Data Structures
by: Ko, Young Kun
Published: (2026)

Foundations of Vector Retrieval
by: Bruch, Sebastian
Published: (2024)

On the LSH Distortion of Ulam and Cayley Similarities
by: Chierichetti, Flavio, et al.
Published: (2026)

Protecting participants or population? Comparison of k-anonymous Origin-Destination matrices
by: Armenante, Pietro, et al.
Published: (2025)

Efficient Top-k s-Biplexes Search over Large Bipartite Graphs
by: Xu, Zhenxiang, et al.
Published: (2024)

Fast and exact fixed-radius neighbor search based on sorting
by: Chen, Xinye, et al.
Published: (2022)

Streaming Stochastic Submodular Maximization with On-Demand User Requests
by: Wang, Honglian, et al.
Published: (2026)

Prune, Don't Rebuild: Efficiently Tuning $α$-Reachable Graphs for Nearest Neighbor Search
by: Zhang, Tian, et al.
Published: (2026)

Hierarchical Locality Sensitive Hashing for Structured Data: A Survey
by: Wu, Wei, et al.
Published: (2022)

An Effective Tag Assignment Approach for Billboard Advertisement
by: Ali, Dildar, et al.
Published: (2024)

Average Case Graph Searching in Non-Uniform Cost Models
by: Szyfelbein, Michał
Published: (2026)

Testing Identity of Distributions under Kolmogorov Distance in Polylogarithmic Space
by: Lebeda, Christian Janos, et al.
Published: (2024)

Deterministic Retrieval at Scale: Optimal-Space LCP Indexing and 308x Energy Reduction on Modern GPUs
by: Byriukov, Stanislav
Published: (2026)

Bridging Classical and Quantum String Matching: A Computational Reformulation of Bit-Parallelism
by: Faro, Simone, et al.
Published: (2025)

Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search
by: Gottesbüren, Lars, et al.
Published: (2024)

Efficient Inference of Sub-Item Id-based Sequential Recommendation Models with Millions of Items
by: Petrov, Aleksandr V., et al.
Published: (2024)

A novel DFS/BFS approach towards link prediction
by: Dörpinghaus, Jens, et al.
Published: (2024)

Explicit Good Codes Approaching Distance 1 in Ulam Metric
by: Goldenberg, Elazar, et al.
Published: (2024)

Dynamic Boundary Time Warping for Sub-sequence Matching with Few Examples
by: Borchmann, Łukasz, et al.
Published: (2020)

AiSAQ: All-in-Storage ANNS with Product Quantization for DRAM-free Information Retrieval
by: Tatsuno, Kento, et al.
Published: (2024)

Error-Tolerant E-Discovery Protocols
by: Dong, Jinshuo, et al.
Published: (2024)

Constructing self-referential instances for the clique problem
by: Li, Jiaqi, et al.
Published: (2026)

The complexity of finding and enumerating optimal subgraphs to represent spatial correlation
by: Enright, Jessica, et al.
Published: (2020)

Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better
by: Balmaseda, Vicente, et al.
Published: (2024)

CARAMEL: A Succinct Read-Only Lookup Table via Compressed Static Functions
by: Coleman, Benjamin, et al.
Published: (2023)