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: 4069
Venue: SIGMOD
Year: 2008
Pagerank: 7.0665158e-05
Overall Rank: 3,862 | 73.51%
DOI: 10.1145/1376616.1376663

Incoming Non-self Citations Over Time

Authors

1. Nan Wang (National University of Singapore)
2. Srinivasan Parthasarathy (Ohio State University)
3. Kian-Lee Tan (National University of Singapore)
4. Anthony K. H. Tung (National University of Singapore)

BibTeX Citation

@inproceedings{wang_sigmod08,
        title = {{CSV: Visualizing and Mining Cohesive Subgraphs}},
        author = {Wang, Nan and Parthasarathy, Srinivasan and Tan, Kian-Lee and Tung, Anthony K. H.},
        series = {{SIGMOD} '08},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1376616.1376663},
        url = {https://dl.acm.org/doi/10.1145/1376616.1376663},
        year = {2008}
}

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
262	On Triangulation-based Dense Neighborhood Graph Discovery	2011	VLDB	0.00023084332
590	Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis	2013	VLDB	0.0001605572
1,018	Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification	2012	VLDB	0.0001263063
9,049	BCviz: A Linear-Space Index for Mining and Visualizing Cohesive Bipartite Subgraphs	2025	SIGMOD	5.3251649e-05
10,407	Theoretically and Practically Efficient Maximum Biclique Search	2026	SIGMOD	5.093636e-05
12,158	ALID: Scalable Dominant Cluster Detection	2015	VLDB	5.093636e-05
12,272	PLASMA-HD: Probing the LAttice Structure and MAkeup of High-dimensional Data	2013	VLDB	5.093636e-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
27	Fast Algorithms for Mining Association Rules	1994	VLDB	0.00052255472
37	DISCOVER: Keyword Search in Relational Databases	2002	VLDB	0.00048017193
212	Efficient IR-Style Keyword Search over Relational Databases	2003	VLDB	0.000247733
291	OPTICS: Ordering Points To Identify the Clustering Structure	1999	SIGMOD	0.00022264197
483	FastMap: A Fast Algorithm for Indexing, Data-Mining and Visualization of Traditional and Multimedia Datasets	1995	SIGMOD	0.00017756569
12,729	Mining Top-k Covering Rule Groups for Gene Expression Data	2005	SIGMOD	5.093636e-05
12,765	FARMER: Finding Interesting Rule Groups in Microarray Datasets	2004	SIGMOD	5.093636e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	3,148	Finding Locally Densest Subgraphs: A Convex Programming Approach	2022	VLDB
2	8,477	Cohesiveness-aware Hierarchical Compressed Index for Community Search on Attributed Graphs	2025	SIGMOD
3	7,466	Mining Attribute-structure Correlated Patterns in Large Attributed Graphs	2012	VLDB
4	9,049	BCviz: A Linear-Space Index for Mining and Visualizing Cohesive Bipartite Subgraphs	2025	SIGMOD
5	10,930	Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory	2025	VLDB
6	2,083	Fast Hierarchy Construction for Dense Subgraphs	2017	VLDB
7	262	On Triangulation-based Dense Neighborhood Graph Discovery	2011	VLDB
8	2,024	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB
9	8,206	Mining Top-k Pairs of Correlated Subgraphs in a Large Network	2020	VLDB
10	590	Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis	2013	VLDB