CSV: Visualizing and Mining Cohesive Subgraphs

Summary: CSV proposes an approximate algorithm mapping edges and nodes into a multi-dimensional space to visualize cohesive subgraphs; dense regions reveal cohesive components. With worst-case O(V^2 log V) for fixed dimension (often sub-quadratic in practice), it enables visualization and pre-filtering to scale exact miners like CLAN. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 4007
Venue: SIGMOD
Year: 2008
Pagerank: 7.0538737e-05
Overall Rank: 3,480 | 75.80%
DOI: -

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
110	On Triangulation-based Dense Neighborhood Graph Discovery	2011	VLDB	0.00047892924
738	Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis	2013	VLDB	0.00017435236
1,029	Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification	2012	VLDB	0.00014582849
8,897	BCviz: A Linear-Space Index for Mining and Visualizing Cohesive Bipartite Subgraphs	2025	SIGMOD	4.427232e-05
10,119	Theoretically and Practically Efficient Maximum Biclique Search	2026	SIGMOD	4.1945683e-05
11,960	ALID: Scalable Dominant Cluster Detection	2015	VLDB	4.1945683e-05
12,075	PLASMA-HD: Probing the LAttice Structure and MAkeup of High-dimensional Data	2013	VLDB	4.1945683e-05

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
36	Fast Algorithms for Mining Association Rules	1994	VLDB	0.00076161096
54	DISCOVER: Keyword Search in Relational Databases	2002	VLDB	0.00066047203
270	OPTICS: Ordering Points To Identify the Clustering Structure	1999	SIGMOD	0.00029505642
276	Efficient IR-Style Keyword Search over Relational Databases	2003	VLDB	0.00029336949
471	FastMap: A Fast Algorithm for Indexing, Data-Mining and Visualization of Traditional and Multimedia Datasets	1995	SIGMOD	0.00022364776
12,536	Mining Top-k Covering Rule Groups for Gene Expression Data	2005	SIGMOD	4.1945683e-05
12,572	FARMER: Finding Interesting Rule Groups in Microarray Datasets	2004	SIGMOD	4.1945683e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
3,575	Finding Locally Densest Subgraphs: A Convex Programming Approach	2022	VLDB	6.9528126e-05
9,552	Cohesiveness-aware Hierarchical Compressed Index for Community Search on Attributed Graphs	2025	SIGMOD	4.3254416e-05
7,614	Mining Attribute-structure Correlated Patterns in Large Attributed Graphs	2012	VLDB	4.6947636e-05
8,897	BCviz: A Linear-Space Index for Mining and Visualizing Cohesive Bipartite Subgraphs	2025	SIGMOD	4.427232e-05
10,681	Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory	2025	VLDB	4.1945683e-05
2,512	Fast Hierarchy Construction for Dense Subgraphs	2017	VLDB	8.6196023e-05
110	On Triangulation-based Dense Neighborhood Graph Discovery	2011	VLDB	0.00047892924
2,909	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB	7.9305767e-05
8,210	Mining Top-k Pairs of Correlated Subgraphs in a Large Network	2020	VLDB	4.5581054e-05
738	Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis	2013	VLDB	0.00017435236