DBScholar

Back to papers

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

Summary: RECEIPT parallelizes bipartite tip decomposition by relaxing minimum-butterfly peeling into coarsely grained independent vertex tasks, reducing synchronization and wedge exploration. A hybrid peeling strategy yields up to 1100× fewer synchronizations, 64× fewer wedges, and 17.1× speedup. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
12750
Venue
VLDB
Year
2021
Pagerank
5.5805027e-05
Overall Rank
7,624 | 47.70%
DOI
10.14778/3430915.3430929

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{lakhotia_vldb21,
        title = {{RECEIPT: REfine CoarsE-grained IndePendent Tasks for Parallel Tip decomposition of Bipartite Graphs}},
        author = {Lakhotia, Kartik and Kannan, Rajgopal and Prasanna, Viktor and De Rose, Cesar A. F.},
        journal = {PVLDB},
        series = {{VLDB} '21},
        volume = {14},
        number = {3},
        pages = {404--417},
        doi = {10.14778/3430915.3430929},
        url = {https://doi.org/10.14778/3430915.3430929},
        year = {2021}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
6,368 Theoretically and Practically Efficient Parallel Nucleus Decomposition 2022 VLDB 5.8975125e-05
9,695 Parallel Algorithms for Hierarchical Nucleus Decomposition 2024 SIGMOD 5.2351259e-05
10,941 Effective and Efficient Community Search for Complex Network Semantics Capture: From Coarse-Grain to Fine-Grain 2025 VLDB 5.093636e-05
Previous Page 1 / 1 Next

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
102 Truss Decomposition in Massive Networks 2012 VLDB 0.00034255289
138 Discovering Large Dense Subgraphs in Massive Graphs 2005 VLDB 0.00029823423
262 On Triangulation-based Dense Neighborhood Graph Discovery 2011 VLDB 0.00023084332
548 Graph Summarization with Bounded Error 2008 SIGMOD 0.00016694936
825 K-Core Decomposition of Large Networks on a Single PC 2016 VLDB 0.00013779895
1,018 Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification 2012 VLDB 0.0001263063
1,102 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00012166591
1,211 Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks 2019 VLDB 0.00011648789
1,416 Local Algorithms for Hierarchical Dense Subgraph Discovery 2019 VLDB 0.00010839488
1,511 Speedup Graph Processing by Graph Ordering 2016 SIGMOD 0.00010538011
1,640 Distance-generalized Core Decomposition 2019 SIGMOD 0.00010153865
1,647 Effective and Efficient Community Search over Large Heterogeneous Information Networks 2020 VLDB 0.00010125633
2,024 Efficient Algorithms for Densest Subgraph Discovery 2019 VLDB 9.2907829e-05
2,083 Fast Hierarchy Construction for Dense Subgraphs 2017 VLDB 9.1976617e-05
2,112 Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions 2018 SIGMOD 9.1514258e-05
2,152 Scaling Distance Labeling on Small-World Networks 2019 SIGMOD 9.0778596e-05
5,468 Ego-net Community Mining Applied to Friend Suggestion 2016 VLDB 6.2073549e-05
9,003 Planting Trees for scalable and efficient Canonical Hub Labeling 2020 VLDB 5.3345443e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 5,674 Efficient Core Maintenance in Large Bipartite Graphs 2023 SIGMOD
2 5,697 Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs 2021 VLDB
3 6,368 Theoretically and Practically Efficient Parallel Nucleus Decomposition 2022 VLDB
4 9,218 GraphTwist: Fast Iterative Graph Computation with Two-tier Optimizations 2015 VLDB
5 5,317 Efficient Load-Balanced Butterfly Counting on GPU 2022 VLDB
6 1,211 Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks 2019 VLDB
7 9,689 Density Decomposition of Bipartite Graphs 2025 SIGMOD
8 10,772 Parallel k-Core Decomposition: Theory and Practice 2025 SIGMOD
9 6,617 Efficient Parallel D-core Decomposition at Scale 2024 VLDB
10 7,144 Towards Distributed Bitruss Decomposition on Bipartite Graphs 2022 VLDB