Image de couverture de livre

Covering a Graph with Dense Subgraph Families, via Triangle-Rich Sets

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Basu, Sabyasachi, Paul-Pena, Daniel, Qian, Kun, Seshadhri, C., Huang, Edward W, Subbian, Karthik
Format:	Preprint
Publié:	2024
Sujets:	Social and Information Networks Data Structures and Algorithms Information Retrieval
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

TIMEST: Temporal Information Motif Estimator Using Sampling Trees
par: Pan, Yunjie, et autres
Publié: (2025)

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)

Spectral Triadic Decompositions of Real-World Networks
par: Basu, Sabyasachi, et autres
Publié: (2022)

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

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

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

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

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

iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search
par: Xu, Yuexuan, et autres
Publié: (2024)

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

Subgraph Counting in Subquadratic Time for Bounded Degeneracy Graphs
par: Paul-Pena, Daniel, et autres
Publié: (2024)

A Sublinear Algorithm for Approximate Shortest Paths in Large Networks
par: Basu, Sabyasachi, et autres
Publié: (2024)

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)

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)

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)

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)

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

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

Efficient Sketching and Nearest Neighbor Search Algorithms for Sparse Vector Sets
par: Bruch, Sebastian, et autres
Publié: (2025)

Diversity-Aware $k$-Maximum Inner Product Search Revisited
par: Huang, Qiang, et autres
Publié: (2024)

Counting hypertriangles through hypergraph orientations
par: Paul-Pena, Daniel, et autres
Publié: (2026)

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search
par: Azizi, Ilias, 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)

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

Autumn: A Scalable Read Optimized LSM-tree based Key-Value Stores with Fast Point and Range Read Speed
par: Zhao, Fuheng, et autres
Publié: (2023)

Linked Array Tree: A Constant-Time Search Structure for Big Data
par: Liu, Songpeng
Publié: (2025)

MUVERA: Multi-Vector Retrieval via Fixed Dimensional Encodings
par: Dhulipala, Laxman, et autres
Publié: (2024)

Correlation Sketches for Approximate Join-Correlation Queries
par: Santos, Aécio, et autres
Publié: (2021)

RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search
par: Gao, Jianyang, et autres
Publié: (2024)

Graph Reconstruction from Noisy Random Subgraphs
par: McGregor, Andrew, et autres
Publié: (2024)