Research map / Graph learning / Graph algorithms and clustering
Combinatorial Learning of Robust Deep Graph Matching: An Embedding Based Approach
Runzhong Wang, Junchi Yan, Xiaokang Yang
Read the paperCheck your idea against 137,217 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
- Learning Combinatorial Embedding Networks for Deep Graph Matching (ICCV 2019 · similarity 0.97)
- Deep Learning of Graph Matching (CVPR 2018 · similarity 0.94)
- Learning deep graph matching with channel-independent embedding and Hungarian attention (ICLR 2020 · similarity 0.94)
- Learning Combinatorial Solver for Graph Matching (CVPR 2020 · similarity 0.93)
- Neural Graph Matching Network: Learning Lawler’s Quadratic Assignment Problem with Extension to Hypergraph and Multiple-graph Matching (TPAMI 2021 · similarity 0.92)
- Learning Partial Graph Matching via Optimal Partial Transport (ICLR 2025 · similarity 0.91)
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.
