Back to papers
X-Blossom: Massive Parallelization of Graph Maximum Matching
Summary: X-Blossom: recursion-free parallelization of Edmonds' blossom that finds many disjoint augmenting paths via a compact path table, removing dynamic graph/tree updates. Delivers up to 992× vs best sequential and avg 431× vs prior parallel (8 cores), with good scaling to 64 cores—claimed fastest general-graph max-matching.
(summarized by gpt-5-mini on Feb 09 2026)
- Paper ID
- 13964
- Venue
- VLDB
- Year
- 2025
- Pagerank
- 4.1945683e-05
- Overall Rank
- 10,670 | 25.78%
- DOI
-
10.14778/3748191.3748199
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
Outgoing Citations (Sorted by Pagerank)
Showing 19 of 19 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 331 |
The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing |
2018 |
VLDB |
0.00027214222 |
| 1,500 |
Parallel Subgraph Listing in a Large-Scale Graph |
2014 |
SIGMOD |
0.00011674394 |
| 1,850 |
Real-time Targeted Influence Maximization for Online Advertisements |
2015 |
VLDB |
0.00010328335 |
| 3,009 |
Pangolin: An Efficient and Flexible Graph Mining System on CPU and GPU |
2020 |
VLDB |
7.7214924e-05 |
| 3,646 |
G-CARE: A Framework for Performance Benchmarking of Cardinality Estimation Techniques for Subgraph Matching |
2020 |
SIGMOD |
6.8853079e-05 |
| 4,921 |
Efficient Cohesive Subgraphs Detection in Parallel |
2014 |
SIGMOD |
5.8237536e-05 |
| 5,589 |
Neighborhood-based Hypergraph Core Decomposition |
2023 |
VLDB |
5.4216989e-05 |
| 5,973 |
On Optimal Worst-Case Matching |
2013 |
SIGMOD |
5.2470655e-05 |
| 6,545 |
Clustering Uncertain Graphs |
2018 |
VLDB |
5.0193115e-05 |
| 7,307 |
SUFF: Accelerating Subgraph Matching with Historical Data |
2023 |
VLDB |
4.7674113e-05 |
| 7,716 |
Minimum Strongly Connected Subgraph Collection in Dynamic Graphs |
2024 |
VLDB |
4.6696364e-05 |
| 8,093 |
Scalable Distributed Inverted List Indexes in Disaggregated Memory |
2024 |
SIGMOD |
4.5873721e-05 |
| 8,376 |
From Anomaly Detection to Rumour Detection using Data Streams of Social Platforms |
2019 |
VLDB |
4.5321619e-05 |
| 8,809 |
Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks |
2024 |
VLDB |
4.4443756e-05 |
| 9,267 |
PimPam: Efficient Graph Pattern Matching on Real Processing-in-Memory Hardware |
2024 |
SIGMOD |
4.3663649e-05 |
| 9,360 |
MITra: A Framework for Multi-Instance Graph Traversal |
2023 |
VLDB |
4.350809e-05 |
| 9,679 |
Real-time Insertion Operator for Shared Mobility on Time-Dependent Road Networks |
2024 |
VLDB |
4.3047774e-05 |
| 9,680 |
PCSP: Efficiently Answering Label-Constrained Shortest Path Queries in Road Networks |
2024 |
VLDB |
4.3047774e-05 |
| 9,686 |
Mining Revenue-Maximizing Bundling Configuration |
2015 |
VLDB |
4.3047774e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 4,143 |
Efficient Algorithms for Exact Ranked Twig-Pattern Matching over Graphs |
2008 |
SIGMOD |
6.4129418e-05 |
| 11,191 |
Parallel Strong Connectivity Based on Faster Reachability |
2023 |
SIGMOD |
4.1945683e-05 |
| 1,561 |
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together |
2019 |
SIGMOD |
0.00011358946 |
| 651 |
Efficient Subgraph Matching on Billion Node Graphs |
2012 |
VLDB |
0.00018648572 |
| 4,556 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
6.0883757e-05 |
| 11,559 |
Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees |
2020 |
SIGMOD |
4.1945683e-05 |
| 2,409 |
TreeSpan: Efficiently Computing Similarity All-Matching |
2012 |
SIGMOD |
8.8776858e-05 |
| 1,414 |
Graph Pattern Matching: From Intractable to Polynomial Time |
2010 |
VLDB |
0.00012118275 |
| 10,084 |
GraphMatch: Subgraph Query Processing on Steroids |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,270 |
Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration |
2026 |
VLDB |
4.1945683e-05 |