Back to papers
Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach
Summary: RRSplit is a redundancy-reduced backtracking algorithm for maximum common subgraph search. It introduces reductions and upper bounds to prune unpromising branches, providing a worst-case guarantee matching the best-known bound while delivering substantial practical speedups over McSplit.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 7292
- Venue
- SIGMOD
- Year
- 2025
- Pagerank
- 4.2482599e-05
- Overall Rank
- 9,935 | 30.89%
- DOI
-
10.1145/3725404
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 12 of 12 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 572 |
Substructure Similarity Search in Graph Databases |
2005 |
SIGMOD |
0.00019887011 |
| 612 |
Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism |
2008 |
VLDB |
0.0001920234 |
| 764 |
TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases |
2013 |
SIGMOD |
0.00017018712 |
| 1,180 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013456907 |
| 1,561 |
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together |
2019 |
SIGMOD |
0.00011358946 |
| 1,775 |
CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching |
2019 |
SIGMOD |
0.00010602927 |
| 3,036 |
RapidMatch: A Holistic Approach to Subgraph Query Processing |
2021 |
VLDB |
7.6735171e-05 |
| 3,187 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
7.4136521e-05 |
| 3,752 |
Computing Graph Edit Distance via Neural Graph Matching |
2023 |
VLDB |
6.7879009e-05 |
| 4,470 |
GuP: Fast Subgraph Matching by Guard-based Pruning |
2023 |
SIGMOD |
6.1557462e-05 |
| 4,968 |
Efficient GPU-Accelerated Subgraph Matching |
2023 |
SIGMOD |
5.7956205e-05 |
| 5,728 |
Circinus: Fast Redundancy-Reduced Subgraph Matching |
2023 |
SIGMOD |
5.3507988e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 5,854 |
Diversified Top-k Subgraph Querying in a Large Graph |
2016 |
SIGMOD |
5.3006473e-05 |
| 5,043 |
The Complexity of Mining Maximal Frequent Subgraphs |
2013 |
PODS |
5.7411631e-05 |
| 10,264 |
CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination |
2026 |
VLDB |
4.1945683e-05 |
| 2,225 |
Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs |
2021 |
SIGMOD |
9.2479064e-05 |
| 1,561 |
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together |
2019 |
SIGMOD |
0.00011358946 |
| 10,119 |
Theoretically and Practically Efficient Maximum Biclique Search |
2026 |
SIGMOD |
4.1945683e-05 |
| 2,007 |
Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs |
2015 |
VLDB |
9.8081235e-05 |
| 10,014 |
BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching |
2026 |
SIGMOD |
4.1945683e-05 |
| 1,180 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013456907 |
| 7,757 |
Identifying Similar-Bicliques in Bipartite Graphs |
2022 |
VLDB |
4.6598957e-05 |