Research map / Graph learning / Graph algorithms and clustering
Binary Constraint Preserving Graph Matching
Check your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use BPGM instead of RRWM | Graph matching · Synthetic graph matching | matching accuracy | Helped |
| Use BPGM instead of RRWM | Graph matching · Synthetic graph matching | objective score | Helped |
| Use BPGM instead of IPFP | Graph matching · Synthetic graph matching | matching accuracy | Helped |
| Use BPGM instead of FGM | Graph matching · Synthetic graph matching | matching accuracy | Helped |
| Use BPGM instead of FGM | Graph matching · Synthetic graph matching | running time | Helped |
| Use BPGM instead of the compared methods | Graph matching · CMU hotel image sequence | matching accuracy | Helped |
| Use BPGM instead of the compared methods | Graph matching · CMU hotel image sequence | objective score | Helped |
| Use BPGM instead of SM, SMAC, IPFP, and RRWM | Graph matching · ZuBud image dataset | true positive | Helped |
| Use BPGM instead of SM, SMAC, IPFP, and RRWM | Graph matching · ZuBud image dataset | objective score | Helped |
| Use BPGM instead of the compared methods | Graph matching · Pascal 2007 car and motorbike images | matching performance | Helped |
Closest papers by meaning
- A Convex Relaxation for Multi-Graph Matching (CVPR 2019 · similarity 0.88)
- Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS (ICML 2024 · similarity 0.85)
- Learning Partial Graph Matching via Optimal Partial Transport (ICLR 2025 · similarity 0.84)
- Graph Alignment via Birkhoff Relaxation (NeurIPS 2025 · similarity 0.84)
- FRAM: Frobenius-Regularized Assignment Matching with Mixed-Precision Computing (NeurIPS 2025 · similarity 0.83)
- Discrete Cycle-Consistency Based Unsupervised Deep Graph Matching (AAAI 2024 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.