Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis

Summary: Introduces a cohesion-oriented subgraph model and I/O-efficient discovery algorithm for large-scale social graphs. An integrated visual analytics system retrieves keyword-local communities, hierarchically lays out influential actors, and summarizes interactions via tag clouds. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: h253f655d2eaafb7f
Venue: VLDB
Year: 2013
Pagerank: 0.00016057466
Overall Rank: 580 | 96.12%
DOI: 10.14778/2535568.2535570

Incoming Non-self Citations Over Time

Authors

1. Feng Zhao (National University of Singapore)
2. Anthony K. H. Tung (National University of Singapore)

BibTeX Citation

@article{zhao_vldb13,
        title = {{Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis}},
        author = {Zhao, Feng and Tung, Anthony K. H.},
        journal = {PVLDB},
        series = {{VLDB} '13},
        volume = {6},
        number = {2},
        pages = {85--96},
        doi = {10.14778/2535568.2535570},
        url = {https://doi.org/10.14778/2535568.2535570},
        year = {2013}
}

Incoming Citations (Sorted by Pagerank)

Showing 32 of 32 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
970	Influential Community Search in Large Networks	2015	VLDB	0.00012749284
1,045	Truss-based Community Search: a Truss-equivalence Based Indexing Approach	2017	VLDB	0.00012318828
1,613	Distance-generalized Core Decomposition	2019	SIGMOD	0.00010057822
1,995	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB	9.2189157e-05
2,005	Fast Hierarchy Construction for Dense Subgraphs	2017	VLDB	9.1851569e-05
2,072	Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms	2016	SIGMOD	9.0668141e-05
2,613	Community Detection in Social Networks: An In-depth Benchmarking Study with a Procedure-Oriented Framework	2015	VLDB	8.2024968e-05
2,873	Hierarchical Core Maintenance on Large Dynamic Graphs	2021	VLDB	7.9005874e-05
3,644	Efficient and Effective Algorithms for Clustering Uncertain Graphs	2019	VLDB	7.1224321e-05
4,180	Global Reinforcement of Social Networks: The Anchored Coreness Problem	2020	SIGMOD	6.7474268e-05
4,597	OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks	2017	VLDB	6.4979622e-05
4,731	Efficient Cohesive Subgraphs Detection in Parallel	2014	SIGMOD	6.4313179e-05
5,575	Theoretically and Practically Efficient Parallel Nucleus Decomposition	2022	VLDB	6.0626208e-05
6,226	I/O Efficient ECC Graph Decomposition via Graph Reduction	2016	VLDB	5.8266364e-05
6,465	Efficient Progressive Minimum k-Core Search	2020	VLDB	5.7596353e-05
6,559	Fast Algorithms for Core Maximization on Large Graphs	2022	VLDB	5.7289742e-05
7,832	A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery	2024	SIGMOD	5.4289543e-05
8,088	Efficient Star-based Truss Maintenance on Dynamic Graphs	2023	SIGMOD	5.3746503e-05
8,993	An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery	2024	SIGMOD	5.2288673e-05
9,514	Accelerating Core Decomposition in Billion-Scale Hypergraphs	2025	SIGMOD	5.151324e-05
9,604	Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs	2024	VLDB	5.1376962e-05
9,768	Approximate Anchored Densest Subgraph Search on Large Static and Dynamic Graphs	2025	VLDB	5.115551e-05
9,911	Parallel Algorithms for Hierarchical Nucleus Decomposition	2024	SIGMOD	5.0983269e-05
9,957	Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs	2024	VLDB	5.0910746e-05
10,407	Scaling Up Density Decomposition on Massive Graphs	2027	SIGMOD	4.9605343e-05
10,499	Bound-Tightened Densest Subgraph Discovery on GPU	2026	SIGMOD	4.9605343e-05
10,562	Nucleus Decomposition Revisited: An Efficient Counting-Based Approach	2026	SIGMOD	4.9605343e-05
10,671	Theoretically and Practically Efficient Maximum Biclique Search	2026	SIGMOD	4.9605343e-05
10,684	A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs	2026	SIGMOD	4.9605343e-05
10,879	Efficient Locally h-Clique Densest Subgraph Discovery via Divide-and-Conquer	2026	VLDB	4.9605343e-05
11,383	Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory	2025	VLDB	4.9605343e-05
11,966	Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques	2022	VLDB	4.9605343e-05

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
96	Truss Decomposition in Massive Networks	2012	VLDB	0.00034261728
255	On Triangulation-based Dense Neighborhood Graph Discovery	2011	VLDB	0.00022949287
3,903	CSV: Visualizing and Mining Cohesive Subgraphs	2008	SIGMOD	6.9150978e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	11,390	Effective and Efficient Community Search for Complex Network Semantics Capture: From Coarse-Grain to Fine-Grain	2025	VLDB
2	696	Effective Community Search for Large Attributed Graphs	2016	VLDB
3	7,165	Topic-based Community Search over Spatial-Social Networks	2020	VLDB
4	11,293	Synergetic Community Search over Large Multilayer Graphs	2025	VLDB
5	970	Influential Community Search in Large Networks	2015	VLDB
6	12,396	Graph Summarization for Geo-correlated Trends Detection in Social Networks	2016	SIGMOD
7	10,394	Effective Structurally Similar Community Search in Large Temporal Graphs	2027	SIGMOD
8	4,861	An Optimal and Progressive Approach to Online Search of Top-K Influential Communities	2018	VLDB
9	3,881	Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions	2021	SIGMOD
10	3,903	CSV: Visualizing and Mining Cohesive Subgraphs	2008	SIGMOD