Image de couverture de livre

BBK: a simpler, faster algorithm for enumerating maximal bicliques in large sparse bipartite graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Baudin, Alexis, Magnien, Clémence, Tabourier, Lionel
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms Computational Complexity Information Retrieval Social and Information Networks
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Faster maximal clique enumeration in large real-world link streams
par: Baudin, Alexis, et autres
Publié: (2023)

LSCPM: communities in massive real-world Link Streams by Clique Percolation Method
par: Baudin, Alexis, et autres
Publié: (2023)

Covering a Graph with Dense Subgraph Families, via Triangle-Rich Sets
par: Basu, Sabyasachi, et autres
Publié: (2024)

Counting Graphlets of Size $k$ under Local Differential Privacy
par: Suppakitpaisarn, Vorapong, et autres
Publié: (2025)

The Theory and Practice of Computing the Bus-Factor
par: Piccolo, Sebastiano A., et autres
Publié: (2026)

Accurate and Fast Estimation of Temporal Motifs using Path Sampling
par: Pan, Yunjie, et autres
Publié: (2024)

Triadic First-Order Logic Queries in Temporal Networks
par: Bhalerao, Omkar, et autres
Publié: (2025)

Parallel Algorithms for Median Consensus Clustering in Complex Networks
par: Hussain, Md Taufique, et autres
Publié: (2024)

Seed Selection in the Heterogeneous Moran Process
par: Petsinis, Petros, et autres
Publié: (2024)

Aggregating maximal cliques in real-world graphs
par: Alon, Noga, et autres
Publié: (2025)

Foundations of Vector Retrieval
par: Bruch, Sebastian
Publié: (2024)

On the LSH Distortion of Ulam and Cayley Similarities
par: Chierichetti, Flavio, et autres
Publié: (2026)

Protecting participants or population? Comparison of k-anonymous Origin-Destination matrices
par: Armenante, Pietro, et autres
Publié: (2025)

Efficient Top-k s-Biplexes Search over Large Bipartite Graphs
par: Xu, Zhenxiang, et autres
Publié: (2024)

Fast and exact fixed-radius neighbor search based on sorting
par: Chen, Xinye, et autres
Publié: (2022)

Streaming Stochastic Submodular Maximization with On-Demand User Requests
par: Wang, Honglian, et autres
Publié: (2026)

Prune, Don't Rebuild: Efficiently Tuning $α$-Reachable Graphs for Nearest Neighbor Search
par: Zhang, Tian, et autres
Publié: (2026)

Hierarchical Locality Sensitive Hashing for Structured Data: A Survey
par: Wu, Wei, et autres
Publié: (2022)

An Effective Tag Assignment Approach for Billboard Advertisement
par: Ali, Dildar, et autres
Publié: (2024)

Average Case Graph Searching in Non-Uniform Cost Models
par: Szyfelbein, Michał
Publié: (2026)

Testing Identity of Distributions under Kolmogorov Distance in Polylogarithmic Space
par: Lebeda, Christian Janos, et autres
Publié: (2024)

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

Bridging Classical and Quantum String Matching: A Computational Reformulation of Bit-Parallelism
par: Faro, Simone, et autres
Publié: (2025)

Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search
par: Gottesbüren, Lars, et autres
Publié: (2024)

Efficient Inference of Sub-Item Id-based Sequential Recommendation Models with Millions of Items
par: Petrov, Aleksandr V., et autres
Publié: (2024)

Finding coherent node groups in directed graphs
par: Kumpulainen, Iiro, et autres
Publié: (2023)

List Decoding Expander-Based Codes up to Capacity in Near-Linear Time
par: Srivastava, Shashank, et autres
Publié: (2025)

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

Tight Bounds for Noisy Computation of High-Influence Functions, Connectivity, and Threshold
par: Gu, Yuzhou, et autres
Publié: (2025)

Optimality of Frequency Moment Estimation
par: Braverman, Mark, et autres
Publié: (2024)

Improved Decoding of Tanner Codes
par: Zhou, Zhaienhe, et autres
Publié: (2025)

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

Efficiently Constructing Sparse Navigable Graphs
par: Conway, Alex, et autres
Publié: (2025)

On Efficient Approximate Aggregate Nearest Neighbor Queries over Learned Representations
par: Wang, Carrie, et autres
Publié: (2025)

Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search
par: Gao, Jianyang, et autres
Publié: (2024)

jXBW: Fast Substructure Search for Large-Scale JSONL Datasets with LLM Applications
par: Tabei, Yasuo
Publié: (2025)

SAQ: Pushing the Limits of Vector Quantization through Code Adjustment and Dimension Segmentation
par: Li, Hui, et autres
Publié: (2025)

CARAMEL: A Succinct Read-Only Lookup Table via Compressed Static Functions
par: Coleman, Benjamin, et autres
Publié: (2023)

Benchmarking Filtered Approximate Nearest Neighbor Search Algorithms on Transformer-based Embedding Vectors
par: Iff, Patrick, et autres
Publié: (2025)

GPU-Native Approximate Nearest Neighbor Search with IVF-RaBitQ: Fast Index Build and Search
par: Shi, Jifan, et autres
Publié: (2026)