On Triangulation-based Dense Neighborhood Graph Discovery

Summary: Introduces DN-graph, a dense-subgraph pattern that jointly optimizes subgraph size and a minimum pairwise interaction. Offers iterative triangle-based triangulation to approximate DN-graphs without materializing triangles, enabling memory-light semi-streaming mining with pay-as-you-go termination. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 10286
Venue: VLDB
Year: 2011
Pagerank: 0.00047892924
Overall Rank: 110 | 99.24%
DOI: -

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 19 of 19 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
108	Truss Decomposition in Massive Networks	2012	VLDB	0.00048300163
283	Querying K-Truss Community in Large and Dynamic Graphs	2014	SIGMOD	0.00029041257
370	Online Search of Overlapping Communities	2013	SIGMOD	0.00025415479
589	Massive Graph Triangulation	2013	SIGMOD	0.00019576567
738	Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis	2013	VLDB	0.00017435236
1,257	Influential Community Search in Large Networks	2015	VLDB	0.00013020648
1,570	KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs	2020	VLDB	0.00011322927
1,973	Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions	2018	SIGMOD	9.8913631e-05
2,409	TreeSpan: Efficiently Computing Similarity All-Matching	2012	SIGMOD	8.8776858e-05
2,436	Efficient Structural Graph Clustering: An Index-Based Approach	2018	VLDB	8.8252104e-05
2,603	Maximum Co-located Community Search in Large Scale Social Networks	2018	VLDB	8.4666465e-05
2,898	SCAN++: Efficient Algorithm for Finding Clusters, Hubs and Outliers on Large-scale Graphs	2015	VLDB	7.9445129e-05
3,854	Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity	2015	SIGMOD	6.6988744e-05
4,145	Scaling Up k-Clique Densest Subgraph Detection	2023	SIGMOD	6.4122551e-05
6,207	Efficiently Computing k-Edge Connected Components via Graph Decomposition	2013	SIGMOD	5.1572428e-05
7,346	I/O Efficient ECC Graph Decomposition via Graph Reduction	2016	VLDB	4.7556749e-05
7,804	RECEIPT: REfine CoarsE-grained IndePendent Tasks for Parallel Tip decomposition of Bipartite Graphs	2021	VLDB	4.6466513e-05
8,540	On Asymptotic Cost of Triangle Listing in Random Graphs	2017	PODS	4.4937074e-05
9,173	HERO: A Hierarchical Set Partitioning and Join Framework for Speeding up the Set Intersection Over Graphs	2024	SIGMOD	4.3842827e-05

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 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.00065491112
3,480	CSV: Visualizing and Mining Cohesive Subgraphs	2008	SIGMOD	7.0538737e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
4,089	On Dense Pattern Mining in Graph Streams [Extended Abstract]	2010	VLDB	6.4587806e-05
10,871	Efficient Computation of Hyper-triangles on Hypergraphs	2025	VLDB	4.1945683e-05
11,410	Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques	2022	VLDB	4.1945683e-05
6,725	Maximal D-truss Search in Dynamic Directed Graphs	2023	VLDB	4.9484066e-05
10,072	Efficient and Scalable Directed Densest Subgraph Discovery	2026	SIGMOD	4.1945683e-05
10,681	Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory	2025	VLDB	4.1945683e-05
10,535	In-depth Analysis of Densest Subgraph Discovery in a Unified Framework	2025	VLDB	4.1945683e-05
4,344	Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs	2020	SIGMOD	6.2744553e-05
2,512	Fast Hierarchy Construction for Dense Subgraphs	2017	VLDB	8.6196023e-05
2,909	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB	7.9305767e-05