Image de couverture de livre

Scalable $k$-clique Densest Subgraph Search

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Ye, Xiaowei, Qiao, Miao, Li, Rong-Hua, Zhang, Qi, Wang, Guoren
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Counting Cohesive Subgraphs with Hereditary Properties
par: Li, Rong-Hua, et autres
Publié: (2024)

An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery
par: Xu, Xiaojia, et autres
Publié: (2024)

Fast Biclique Counting on Bipartite Graphs: A Node Pivot-based Approach
par: Ye, Xiaowei, et autres
Publié: (2024)

Destroying Densest Subgraphs is Hard
par: Bazgan, Cristina, et autres
Publié: (2024)

A Note on Approximability of Densest At-Least-k-Subgraph
par: Laekhanukit, Bundit, et autres
Publié: (2026)

The Vertex-Attribute-Constrained Densest $k$-Subgraph Problem
par: Lu, Qiheng, et autres
Publié: (2025)

New Parallel and Streaming Algorithms for Directed Densest Subgraph
par: Mitrović, Slobodan, et autres
Publié: (2025)

Almost Tight Bounds for Differentially Private Densest Subgraph
par: Dinitz, Michael, et autres
Publié: (2023)

Scalable and Provable Kemeny Constant Computation on Static and Dynamic Graphs: A 2-Forest Sampling Approach
par: Li, Cheng, et autres
Publié: (2025)

Fast and Simple Densest Subgraph with Predictions
par: Bui, Thai, et autres
Publié: (2025)

Fast and Optimal Incremental Parametric Procedure for the Densest Subgraph Problem: An Experimental Study
par: Hochbaum, Dorit S., et autres
Publié: (2025)

In-depth Analysis of Densest Subgraph Discovery in a Unified Framework
par: Zhou, Yingli, et autres
Publié: (2024)

A Survey on the Densest Subgraph Problem and Its Variants
par: Lanciano, Tommaso, et autres
Publié: (2023)

Multiplicative Weights Update, Area Convexity and Random Coordinate Descent for Densest Subgraph Problems
par: Nguyen, Ta Duy, et autres
Publié: (2024)

Efficient Processing of Subsequent Densest Subgraph Query
par: Hung, Chia-Yang, et autres
Publié: (2024)

OptiRefine: Densest subgraphs and maximum cuts with $k$ refinements
par: Tu, Sijing, et autres
Publié: (2025)

K-stars LDP: A Novel Framework for (p, q)-clique Enumeration under Local Differential Privacy
par: Sun, Henan, et autres
Publié: (2024)

Tighter Bounds for Local Differentially Private Core Decomposition and Densest Subgraph
par: Henzinger, Monika, et autres
Publié: (2024)

On Densest $k$-Subgraph Mining and Diagonal Loading: Optimization Landscape and Finite-Step Exact Convergence Analysis
par: Lu, Qiheng, et autres
Publié: (2024)

Improved Algorithms for Effective Resistance Computation on Graphs
par: Yang, Yichun, et autres
Publié: (2025)

Scalable Similarity Search over Large Attributed Bipartite Graphs
par: Ou, Xi, et autres
Publié: (2025)

Differentially Private Densest Subgraph Detection
par: Nguyen, Dung, et autres
Publié: (2021)

On the Efficient Discovery of Maximum $k$-Defective Biclique
par: Cui, Donghang, et autres
Publié: (2025)

Scalable Temporal Motif Densest Subnetwork Discovery
par: Sarpe, Ilie, et autres
Publié: (2024)

Continual Release of Densest Subgraphs: Privacy Amplification & Sublinear Space via Subsampling
par: Zhou, Felix
Publié: (2025)

Kick the cliques
par: Berthe, Gaétan, et autres
Publié: (2024)

A Branch-and-Bound Approach for Maximum Low-Diameter Dense Subgraph Problems
par: Zhou, Yi, et autres
Publié: (2025)

The Densest SWAMP problem: subhypergraphs with arbitrary monotonic partial edge rewards
par: Bengali, Vedangi, et autres
Publié: (2025)

Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach
par: Yang, Yichun, et autres
Publié: (2024)

BD-Index: Scalable Biharmonic Distance Queries on Large Graphs via Divide-and-Conquer Indexing
par: Pan, Yueyang, et autres
Publié: (2025)

Optimal $k$-Secretary with Logarithmic Memory
par: Qiao, Mingda, et autres
Publié: (2025)

Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach
par: Yu, Kaiqiang, et autres
Publié: (2025)

Output-sensitive approximate counting via a measure-bounded hyperedge oracle, or: How asymmetry helps estimate $k$-clique counts faster
par: Censor-Hillel, Keren, et autres
Publié: (2025)

A $O^*((2 + ε)^k)$ Time Algorithm for Cograph Deletion Using Unavoidable Subgraphs in Large Prime Graphs
par: Lafond, Manuel, et autres
Publié: (2026)

Local Search k-means++ with Foresight
par: Conrads, Theo, et autres
Publié: (2024)

Exact recovery of planted cliques in semi-random graphs
par: Khanna, Yash
Publié: (2020)

Finding Order-Preserving Subgraphs
par: Imamura, Haruya, et autres
Publié: (2025)

Forbidden Subgraph Problems with Predictions
par: Böckenhauer, Hans-Joachim, et autres
Publié: (2025)

Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach
par: Liao, Meihao, et autres
Publié: (2025)

Better Decremental and Fully Dynamic Sensitivity Oracles for Subgraph Connectivity
par: Long, Yaowei, et autres
Publié: (2024)