Copertina

In-depth Analysis of Densest Subgraph Discovery in a Unified Framework

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Zhou, Yingli, Guo, Qingshuo, Yang, Yi, Fang, Yixiang, Ma, Chenhao, Lakshmanan, Laks
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Databases Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

BEACON: A Benchmark for Efficient and Accurate Counting of Subgraphs
di: Najafi, Mohammad Matin, et al.
Pubblicazione: (2025)

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

Destroying Densest Subgraphs is Hard
di: Bazgan, Cristina, et al.
Pubblicazione: (2024)

An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery
di: Xu, Xiaojia, et al.
Pubblicazione: (2024)

Scalable $k$-clique Densest Subgraph Search
di: Ye, Xiaowei, et al.
Pubblicazione: (2024)

New Parallel and Streaming Algorithms for Directed Densest Subgraph
di: Mitrović, Slobodan, et al.
Pubblicazione: (2025)

Almost Tight Bounds for Differentially Private Densest Subgraph
di: Dinitz, Michael, et al.
Pubblicazione: (2023)

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

Fast and Simple Densest Subgraph with Predictions
di: Bui, Thai, et al.
Pubblicazione: (2025)

Finding Locally Densest Subgraphs: Convex Programming with Edge and Triangle Density
di: Yang, Yi, et al.
Pubblicazione: (2025)

Efficient Processing of Subsequent Densest Subgraph Query
di: Hung, Chia-Yang, et al.
Pubblicazione: (2024)

Fast and Optimal Incremental Parametric Procedure for the Densest Subgraph Problem: An Experimental Study
di: Hochbaum, Dorit S., et al.
Pubblicazione: (2025)

A Survey on the Densest Subgraph Problem and Its Variants
di: Lanciano, Tommaso, et al.
Pubblicazione: (2023)

A Note on Approximability of Densest At-Least-k-Subgraph
di: Laekhanukit, Bundit, et al.
Pubblicazione: (2026)

Multiplicative Weights Update, Area Convexity and Random Coordinate Descent for Densest Subgraph Problems
di: Nguyen, Ta Duy, et al.
Pubblicazione: (2024)

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

UNIFY: Unified Index for Range Filtered Approximate Nearest Neighbors Search
di: Liang, Anqi, et al.
Pubblicazione: (2024)

A Survey of Densest Subgraph Discovery on Large Graphs
di: Luo, Wensheng, et al.
Pubblicazione: (2023)

A High-Throughput GPU Framework for Adaptive Lossless Compression of Floating-Point Data
di: Li, Zheng, et al.
Pubblicazione: (2025)

The Vertex-Attribute-Constrained Densest $k$-Subgraph Problem
di: Lu, Qiheng, et al.
Pubblicazione: (2025)

Tighter Bounds for Local Differentially Private Core Decomposition and Densest Subgraph
di: Henzinger, Monika, et al.
Pubblicazione: (2024)

A Theoretical Framework for Distribution-Aware Dataset Search
di: Esmailpour, Aryan, et al.
Pubblicazione: (2025)

Simple Analysis of Priority Sampling
di: Daliri, Majid, et al.
Pubblicazione: (2023)

CuckooGraph: A Scalable and Space-Time Efficient Data Structure for Large-Scale Dynamic Graphs
di: Fan, Zhuochen, et al.
Pubblicazione: (2024)

Continual Release of Densest Subgraphs: Privacy Amplification & Sublinear Space via Subsampling
di: Zhou, Felix
Pubblicazione: (2025)

Fast Answering Pattern-Constrained Reachability Queries with Two-Dimensional Reachability Index
di: Yang, Huihui, et al.
Pubblicazione: (2025)

Differentially Private Densest Subgraph Detection
di: Nguyen, Dung, et al.
Pubblicazione: (2021)

Approaching 100% Confidence in Stream Summary through ReliableSketch
di: Wu, Yuhan, et al.
Pubblicazione: (2024)

Computing Data Distribution from Query Selectivities
di: Agarwal, Pankaj K., et al.
Pubblicazione: (2024)

Subtree Mode and Applications
di: Zhou, Jialong, et al.
Pubblicazione: (2025)

Querying in Constant Expected Time with Learned Indexes
di: Croquevielle, Luis, et al.
Pubblicazione: (2024)

Approximate Butterfly Counting in Sublinear Time
di: Luo, Chi, et al.
Pubblicazione: (2026)

Efficient Hypergraph Pattern Matching via Match-and-Filter and Intersection Constraint
di: Song, Siwoo, et al.
Pubblicazione: (2025)

Socio-Spatial Group Queries for Impromptu Activity Planning
di: Shen, Chih-Ya, et al.
Pubblicazione: (2015)

On Densest $k$-Subgraph Mining and Diagonal Loading: Optimization Landscape and Finite-Step Exact Convergence Analysis
di: Lu, Qiheng, et al.
Pubblicazione: (2024)

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

Scalable Temporal Motif Densest Subnetwork Discovery
di: Sarpe, Ilie, et al.
Pubblicazione: (2024)

Improved Approximation Algorithms for Relational Clustering
di: Esmailpour, Aryan, et al.
Pubblicazione: (2024)

Towards Tractability of the Diversity of Query Answers: Ultrametrics to the Rescue
di: Arenas, Marcelo, et al.
Pubblicazione: (2024)