OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks

Summary: OLAK uses an onion-layer (onion-peeling) structure to solve anchored k-core on large graphs, constraining anchors to onion layers and enabling aggressive pruning. Experiments on 10 real networks show scalable, efficient performance on general graphs, outperforming bounded-treewidth methods. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 11748
Venue: VLDB
Year: 2017
Pagerank: 6.6715036e-05
Overall Rank: 4,485 | 69.23%
DOI: 10.14778/3055330.3055336

Incoming Non-self Citations Over Time

Authors

1. Fan Zhang (University of Technology Sydney)
2. Wenjie Zhang (University of New South Wales)
3. Ying Zhang (University of Technology Sydney)
4. Lu Qin (University of Technology Sydney)
5. Xuemin Lin (University of New South Wales)

BibTeX Citation

@article{zhang_vldb17,
        title = {{OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks}},
        author = {Zhang, Fan and Zhang, Wenjie and Zhang, Ying and Qin, Lu and Lin, Xuemin},
        journal = {PVLDB},
        series = {{VLDB} '17},
        volume = {10},
        number = {6},
        pages = {649--660},
        doi = {10.14778/3055330.3055336},
        url = {https://doi.org/10.14778/3055330.3055336},
        year = {2017}
}

Incoming Citations (Sorted by Pagerank)

Showing 11 of 11 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
2,826	Hierarchical Core Maintenance on Large Dynamic Graphs	2021	VLDB	8.0865974e-05
3,613	Scaling Up k-Clique Densest Subgraph Detection	2023	SIGMOD	7.2572837e-05
4,008	When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks	2017	VLDB	6.9619668e-05
4,331	Global Reinforcement of Social Networks: The Anchored Coreness Problem	2020	SIGMOD	6.7561061e-05
4,579	Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions	2021	SIGMOD	6.6203846e-05
6,342	Efficient Progressive Minimum k-Core Search	2020	VLDB	5.9068493e-05
6,465	Fast Algorithms for Core Maximization on Large Graphs	2022	VLDB	5.871325e-05
8,227	From Anomaly Detection to Rumour Detection using Data Streams of Social Platforms	2019	VLDB	5.4622609e-05
10,534	Anchored Maximum Communities over Large Directed Graphs	2026	VLDB	5.093636e-05
10,656	A Local Search Approach to Efficient (k, p)-Core Maintenance	2025	SIGMOD	5.093636e-05
10,941	Effective and Efficient Community Search for Complex Network Semantics Capture: From Coarse-Grain to Fine-Grain	2025	VLDB	5.093636e-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
276	Local Search of Communities in Large Graphs	2014	SIGMOD	0.00022620623
590	Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis	2013	VLDB	0.0001605572
793	Streaming Algorithms for k-core Decomposition	2013	VLDB	0.00013978774

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	5,149	An Optimal and Progressive Approach to Online Search of Top-K Influential Communities	2018	VLDB
2	2,826	Hierarchical Core Maintenance on Large Dynamic Graphs	2021	VLDB
3	4,672	Efficient Maximum k-Defective Clique Computation with Improved Time Complexity	2023	SIGMOD
4	6,465	Fast Algorithms for Core Maximization on Large Graphs	2022	VLDB
5	793	Streaming Algorithms for k-core Decomposition	2013	VLDB
6	10,365	Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space	2026	SIGMOD
7	8,632	gCore: Exploring Cross-layer Cohesiveness in Multi-layer Graphs	2023	VLDB
8	4,008	When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks	2017	VLDB
9	4,331	Global Reinforcement of Social Networks: The Anchored Coreness Problem	2020	SIGMOD
10	10,534	Anchored Maximum Communities over Large Directed Graphs	2026	VLDB