An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery

Summary: Introduces IPPV, an exact top-k locally h-clique densest-subgraph pipeline under a non-overlapping constraint. It fuses convex-bound tightening, cross-subgraph clique handling via decomposition, and fast flow-based verification, with proofs of exactness and applicability to broader pattern-densest problems. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 6975
Venue: SIGMOD
Year: 2024
Pagerank: 4.3212967e-05
Overall Rank: 9,557 | 33.58%
DOI: 10.1145/3698800

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
10,076	Efficient Size-Bounded Community Search, Revisited: Frameworks for Practical Improvements	2026	SIGMOD	4.1905499e-05

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
57	Discovering Large Dense Subgraphs in Massive Graphs	2005	VLDB	0.00065421423
280	3-HOP: A High-Compression Indexing Scheme for Reachability Query	2009	SIGMOD	0.00029092277
645	Densest Subgraph in Streaming and MapReduce	2012	VLDB	0.00018727714
734	Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis	2013	VLDB	0.00017419528
1,029	Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification	2012	VLDB	0.00014568714
1,570	KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs	2020	VLDB	0.00011311977
2,913	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB	7.9229304e-05
3,406	Piggybacking on Social Networks	2013	VLDB	7.1298853e-05
3,579	Finding Locally Densest Subgraphs: A Convex Programming Approach	2022	VLDB	6.9461197e-05
4,877	Discovering Polarization Niches via Dense Subgraphs with Attractors and Repulsers	2022	VLDB	5.8537804e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
5,365	Anchored Densest Subgraph	2022	SIGMOD	5.5463723e-05
9,251	Densest Multipartite Subgraph Search in Heterogeneous Information Networks	2024	VLDB	4.3648789e-05
3,579	Finding Locally Densest Subgraphs: A Convex Programming Approach	2022	VLDB	6.9461197e-05
11,051	Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs	2024	VLDB	4.1905499e-05
4,341	Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs	2020	SIGMOD	6.268429e-05
2,913	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB	7.9229304e-05
9,409	A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery	2024	SIGMOD	4.3399748e-05
5,274	A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery	2022	SIGMOD	5.5919087e-05
10,072	Efficient and Scalable Directed Densest Subgraph Discovery	2026	SIGMOD	4.1905499e-05
10,689	Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory	2025	VLDB	4.1905499e-05