Database Paper Browser

Back to papers

Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis

Summary: Novel cohesion-based subgraph concept with I/O-efficient discovery for large-scale social networks. Keyword-driven subgraph retrieval from a graph store, orbital layout visualization, and tag-cloud summaries for quick exploration of active communities. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10746
Venue
VLDB
Year
2013
Pagerank
0.00017435236
Overall Rank
738 | 94.87%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 28 of 28 citing papers.

Rank Citing Paper Year Venue Pagerank
1,257 Influential Community Search in Large Networks 2015 VLDB 0.00013020648
1,530 Truss-based Community Search: a Truss-equivalence Based Indexing Approach 2017 VLDB 0.00011495611
1,836 Distance-generalized Core Decomposition 2019 SIGMOD 0.00010365753
2,049 Community Detection in Social Networks: An In-depth Benchmarking Study with a Procedure-Oriented Framework 2015 VLDB 9.6894639e-05
2,512 Fast Hierarchy Construction for Dense Subgraphs 2017 VLDB 8.6196023e-05
2,684 Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms 2016 SIGMOD 8.3136866e-05
2,909 Efficient Algorithms for Densest Subgraph Discovery 2019 VLDB 7.9305767e-05
3,273 Global Reinforcement of Social Networks: The Anchored Coreness Problem 2020 SIGMOD 7.2956944e-05
3,321 Hierarchical Core Maintenance on Large Dynamic Graphs 2021 VLDB 7.223972e-05
3,636 Efficient and Effective Algorithms for Clustering Uncertain Graphs 2019 VLDB 6.8976555e-05
4,728 OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks 2017 VLDB 5.968586e-05
4,921 Efficient Cohesive Subgraphs Detection in Parallel 2014 SIGMOD 5.8237536e-05
6,530 Fast Algorithms for Core Maximization on Large Graphs 2022 VLDB 5.0246792e-05
6,588 Efficient Progressive Minimum k-Core Search 2020 VLDB 5.0020648e-05
6,880 Theoretically and Practically Efficient Parallel Nucleus Decomposition 2022 VLDB 4.8970985e-05
7,346 I/O Efficient ECC Graph Decomposition via Graph Reduction 2016 VLDB 4.7556749e-05
8,014 Efficient Star-based Truss Maintenance on Dynamic Graphs 2023 SIGMOD 4.6058845e-05
9,146 Accelerating Core Decomposition in Billion-Scale Hypergraphs 2025 SIGMOD 4.3849295e-05
9,239 Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs 2024 VLDB 4.3690661e-05
9,403 A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery 2024 SIGMOD 4.3441378e-05
9,557 An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery 2024 SIGMOD 4.3254416e-05
10,119 Theoretically and Practically Efficient Maximum Biclique Search 2026 SIGMOD 4.1945683e-05
10,134 A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs 2026 SIGMOD 4.1945683e-05
10,681 Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory 2025 VLDB 4.1945683e-05
10,865 Approximate Anchored Densest Subgraph Search on Large Static and Dynamic Graphs 2025 VLDB 4.1945683e-05
10,947 Parallel Algorithms for Hierarchical Nucleus Decomposition 2024 SIGMOD 4.1945683e-05
11,048 Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs 2024 VLDB 4.1945683e-05
11,410 Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques 2022 VLDB 4.1945683e-05
Previous Page 1 / 1 Next

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
108 Truss Decomposition in Massive Networks 2012 VLDB 0.00048300163
110 On Triangulation-based Dense Neighborhood Graph Discovery 2011 VLDB 0.00047892924
3,480 CSV: Visualizing and Mining Cohesive Subgraphs 2008 SIGMOD 7.0538737e-05
Previous Page 1 / 1 Next

Semantically Similar Papers