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.00015905948
Overall Rank: 589 | 96.05%
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 31 of 31 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,007	Influential Community Search in Large Networks	2015	VLDB	0.00012556573
1,092	Truss-based Community Search: a Truss-equivalence Based Indexing Approach	2017	VLDB	0.00012072382
1,648	Distance-generalized Core Decomposition	2019	SIGMOD	9.9863775e-05
2,042	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB	9.1416822e-05
2,086	Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms	2016	SIGMOD	9.0689711e-05
2,119	Fast Hierarchy Construction for Dense Subgraphs	2017	VLDB	9.0102885e-05
2,601	Community Detection in Social Networks: An In-depth Benchmarking Study with a Procedure-Oriented Framework	2015	VLDB	8.2335436e-05
2,869	Hierarchical Core Maintenance on Large Dynamic Graphs	2021	VLDB	7.9235321e-05
3,632	Efficient and Effective Algorithms for Clustering Uncertain Graphs	2019	VLDB	7.1494448e-05
4,422	Global Reinforcement of Social Networks: The Anchored Coreness Problem	2020	SIGMOD	6.6060521e-05
4,578	OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks	2017	VLDB	6.5226071e-05
4,755	Efficient Cohesive Subgraphs Detection in Parallel	2014	SIGMOD	6.4323525e-05
5,976	Theoretically and Practically Efficient Parallel Nucleus Decomposition	2022	VLDB	5.9300103e-05
6,211	I/O Efficient ECC Graph Decomposition via Graph Reduction	2016	VLDB	5.8487355e-05
6,466	Efficient Progressive Minimum k-Core Search	2020	VLDB	5.7751978e-05
6,548	Fast Algorithms for Core Maximization on Large Graphs	2022	VLDB	5.7507029e-05
7,807	A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery	2024	SIGMOD	5.4495451e-05
8,066	Efficient Star-based Truss Maintenance on Dynamic Graphs	2023	SIGMOD	5.3950351e-05
8,963	An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery	2024	SIGMOD	5.2486992e-05
9,474	Accelerating Core Decomposition in Billion-Scale Hypergraphs	2025	SIGMOD	5.1708619e-05
9,571	Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs	2024	VLDB	5.1571823e-05
9,731	Approximate Anchored Densest Subgraph Search on Large Static and Dynamic Graphs	2025	VLDB	5.1349531e-05
9,871	Parallel Algorithms for Hierarchical Nucleus Decomposition	2024	SIGMOD	5.1176637e-05
9,915	Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs	2024	VLDB	5.1103839e-05
10,421	Bound-Tightened Densest Subgraph Discovery on GPU	2026	SIGMOD	4.9793485e-05
10,485	Nucleus Decomposition Revisited: An Efficient Counting-Based Approach	2026	SIGMOD	4.9793485e-05
10,599	Theoretically and Practically Efficient Maximum Biclique Search	2026	SIGMOD	4.9793485e-05
10,612	A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs	2026	SIGMOD	4.9793485e-05
10,808	Efficient Locally h-Clique Densest Subgraph Discovery via Divide-and-Conquer	2026	VLDB	4.9793485e-05
11,321	Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory	2025	VLDB	4.9793485e-05
11,916	Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques	2022	VLDB	4.9793485e-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
100	Truss Decomposition in Massive Networks	2012	VLDB	0.00033977856
265	On Triangulation-based Dense Neighborhood Graph Discovery	2011	VLDB	0.00022748633
3,902	CSV: Visualizing and Mining Cohesive Subgraphs	2008	SIGMOD	6.9340634e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	7,058	C-Explorer: Browsing Communities in Large Graphs	2017	VLDB
2	11,329	Effective and Efficient Community Search for Complex Network Semantics Capture: From Coarse-Grain to Fine-Grain	2025	VLDB
3	714	Effective Community Search for Large Attributed Graphs	2016	VLDB
4	7,150	Topic-based Community Search over Spatial-Social Networks	2020	VLDB
5	11,229	Synergetic Community Search over Large Multilayer Graphs	2025	VLDB
6	1,007	Influential Community Search in Large Networks	2015	VLDB
7	12,347	Graph Summarization for Geo-correlated Trends Detection in Social Networks	2016	SIGMOD
8	5,264	An Optimal and Progressive Approach to Online Search of Top-K Influential Communities	2018	VLDB
9	3,875	Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions	2021	SIGMOD
10	3,902	CSV: Visualizing and Mining Cohesive Subgraphs	2008	SIGMOD