Research map / Graph learning / Graph algorithms and clustering
Nonnegative Orthogonal Graph Matching
Read the paperCheck 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.
Closest papers by meaning
- Generalizing Graph Matching beyond Quadratic Assignment Model (NeurIPS 2018 · similarity 0.89)
- Alternating Direction Graph Matching (CVPR 2017 · similarity 0.86)
- FRAM: Frobenius-Regularized Assignment Matching with Mixed-Precision Computing (NeurIPS 2025 · similarity 0.85)
- Graph Alignment via Birkhoff Relaxation (NeurIPS 2025 · similarity 0.84)
- Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS (ICML 2024 · similarity 0.82)
- SAT-Based Algorithms for Regular Graph Pattern Matching (AAAI 2024 · similarity 0.81)
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.