RECEIPT: REfine CoarsE-grained IndePendent Tasks for Parallel Tip decomposition of Bipartite Graphs

Summary: RECEIPT: parallel tip-decomposition for bipartite graphs via independent-task partitioning to peel vertex subsets concurrently. Hybrid peeling yields large speedups: up to 1100x fewer synchronizations, 64x fewer wedges; 17.1x speedup on 36 threads. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 12562
Venue: VLDB
Year: 2021
Pagerank: 4.6466513e-05
Overall Rank: 7,804 | 45.71%
DOI: 10.14778/3430915.3430929

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
6,880	Theoretically and Practically Efficient Parallel Nucleus Decomposition	2022	VLDB	4.8970985e-05
10,694	Effective and Efficient Community Search for Complex Network Semantics Capture: From Coarse-Grain to Fine-Grain	2025	VLDB	4.1945683e-05
10,947	Parallel Algorithms for Hierarchical Nucleus Decomposition	2024	SIGMOD	4.1945683e-05

Outgoing Citations (Sorted by Pagerank)

Showing 18 of 18 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
57	Discovering Large Dense Subgraphs in Massive Graphs	2005	VLDB	0.00065491112
108	Truss Decomposition in Massive Networks	2012	VLDB	0.00048300163
110	On Triangulation-based Dense Neighborhood Graph Discovery	2011	VLDB	0.00047892924
388	Graph Summarization with Bounded Error	2008	SIGMOD	0.00024662272
1,029	Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification	2012	VLDB	0.00014582849
1,150	K-Core Decomposition of Large Networks on a Single PC	2016	VLDB	0.00013657353
1,484	Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks	2019	VLDB	0.00011714263
1,676	Speedup Graph Processing by Graph Ordering	2016	SIGMOD	0.00010946423
1,775	CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching	2019	SIGMOD	0.00010602927
1,836	Distance-generalized Core Decomposition	2019	SIGMOD	0.00010365753
1,973	Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions	2018	SIGMOD	9.8913631e-05
2,039	Local Algorithms for Hierarchical Dense Subgraph Discovery	2019	VLDB	9.7061003e-05
2,286	Effective and Efficient Community Search over Large Heterogeneous Information Networks	2020	VLDB	9.0982591e-05
2,512	Fast Hierarchy Construction for Dense Subgraphs	2017	VLDB	8.6196023e-05
2,639	Scaling Distance Labeling on Small-World Networks	2019	SIGMOD	8.3975113e-05
2,909	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB	7.9305767e-05
5,722	Ego-net Community Mining Applied to Friend Suggestion	2016	VLDB	5.3524548e-05
8,967	Planting Trees for scalable and efficient Canonical Hub Labeling	2020	VLDB	4.4190656e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
6,183	Efficient Core Maintenance in Large Bipartite Graphs	2023	SIGMOD	5.1667703e-05
6,141	Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs	2021	VLDB	5.1903263e-05
6,880	Theoretically and Practically Efficient Parallel Nucleus Decomposition	2022	VLDB	4.8970985e-05
9,072	GraphTwist: Fast Iterative Graph Computation with Two-tier Optimizations	2015	VLDB	4.4024417e-05
5,474	Efficient Load-Balanced Butterfly Counting on GPU	2022	VLDB	5.4881807e-05
1,484	Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks	2019	VLDB	0.00011714263
10,373	Density Decomposition of Bipartite Graphs	2025	SIGMOD	4.1945683e-05
10,495	Parallel k-Core Decomposition: Theory and Practice	2025	SIGMOD	4.1945683e-05
6,513	Efficient Parallel D-core Decomposition at Scale	2024	VLDB	5.0321577e-05
7,788	Towards Distributed Bitruss Decomposition on Bipartite Graphs	2022	VLDB	4.651009e-05