Imagen de Portada

Finding Near-Optimal Maximum Set of Disjoint $k$-Cliques in Real-World Social Networks

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Lin, Wenqing, Chen, Xin, Xie, Haoxuan, Wang, Sibo, Luo, Siqiang
Formato:	Preprint
Publicado:	2025
Materias:	Social and Information Networks Databases Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Diversity-Aware $k$-Maximum Inner Product Search Revisited
por: Huang, Qiang, et al.
Publicado: (2024)

Efficient $k$-Clique Listing: An Edge-Oriented Branching Strategy
por: Wang, Kaixin, et al.
Publicado: (2023)

Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space
por: Jang, Jihoon, et al.
Publicado: (2025)

Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search
por: Gao, Jianyang, et al.
Publicado: (2024)

Effective Individual Fairest Community Search over Heterogeneous Information Networks
por: Zhao, Taige, et al.
Publicado: (2024)

Evaluating Learned Indexes in LSM-tree Systems: Benchmarks,Insights and Design Choices
por: Liu, Junfeng, et al.
Publicado: (2025)

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

Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum
por: Carmeli, Nofar, et al.
Publicado: (2025)

Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach
por: Yu, Kaiqiang, et al.
Publicado: (2025)

Efficiently Constructing Sparse Navigable Graphs
por: Conway, Alex, et al.
Publicado: (2025)

On Efficient Approximate Aggregate Nearest Neighbor Queries over Learned Representations
por: Wang, Carrie, et al.
Publicado: (2025)

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

SAQ: Pushing the Limits of Vector Quantization through Code Adjustment and Dimension Segmentation
por: Li, Hui, et al.
Publicado: (2025)

Benchmarking Filtered Approximate Nearest Neighbor Search Algorithms on Transformer-based Embedding Vectors
por: Iff, Patrick, et al.
Publicado: (2025)

GPU-Native Approximate Nearest Neighbor Search with IVF-RaBitQ: Fast Index Build and Search
por: Shi, Jifan, et al.
Publicado: (2026)

Autumn: A Scalable Read Optimized LSM-tree based Key-Value Stores with Fast Point and Range Read Speed
por: Zhao, Fuheng, et al.
Publicado: (2023)

iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search
por: Xu, Yuexuan, et al.
Publicado: (2024)

Linked Array Tree: A Constant-Time Search Structure for Big Data
por: Liu, Songpeng
Publicado: (2025)

MUVERA: Multi-Vector Retrieval via Fixed Dimensional Encodings
por: Dhulipala, Laxman, et al.
Publicado: (2024)

TIMEST: Temporal Information Motif Estimator Using Sampling Trees
por: Pan, Yunjie, et al.
Publicado: (2025)

Correlation Sketches for Approximate Join-Correlation Queries
por: Santos, Aécio, et al.
Publicado: (2021)

RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search
por: Gao, Jianyang, et al.
Publicado: (2024)

Enumeration of Minimal Hitting Sets Parameterized by Treewidth
por: Kenig, Batya, et al.
Publicado: (2024)

Clustering with Set Outliers and Applications in Relational Clustering
por: Surianarayanan, Vaishali, et al.
Publicado: (2025)

Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance
por: Chang, Lijun
Publicado: (2024)

A Faster Branching Algorithm for the Maximum $k$-Defective Clique Problem
por: Luo, Chunyu, et al.
Publicado: (2024)

Optimal Dynamic Parameterized Subset Sampling
por: Gan, Junhao, et al.
Publicado: (2024)

Weighted Set Multi-Cover on Bounded Universe and Applications in Package Recommendation
por: Shahbazi, Nima, et al.
Publicado: (2026)

A Unified and Scalable Algorithm Framework of User-Defined Temporal $(k,\mathcal{X})$-Core Query
por: Zhong, Ming, et al.
Publicado: (2023)

BBC: Improving Large-k Approximate Nearest Neighbor Search with a Bucket-based Result Collector
por: Yin, Ziqi, et al.
Publicado: (2026)

Near-Optimality for Single-Source Personalized PageRank
por: Jiang, Xinpeng, et al.
Publicado: (2025)

Grafite: Taming Adversarial Queries with Optimal Range Filters
por: Costa, Marco, et al.
Publicado: (2023)

Connected k-Median with Disjoint and Non-disjoint Clusters
por: Eube, Jan, et al.
Publicado: (2025)

A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets
por: Li, Xuan, et al.
Publicado: (2024)

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

A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs
por: Hamada, Kou, et al.
Publicado: (2024)

An Efficient Streaming Algorithm for Approximating Graphlet Distributions
por: Bressan, Marco, et al.
Publicado: (2026)

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search
por: Azizi, Ilias, et al.
Publicado: (2025)

Counting hypertriangles through hypergraph orientations
por: Paul-Pena, Daniel, et al.
Publicado: (2026)

Stable Tree Labelling for Accelerating Distance Queries on Dynamic Road Networks
por: Koehler, Henning, et al.
Publicado: (2025)