Research map / Graph learning / Graph algorithms and clustering
Learning deep graph matching with channel-independent embedding and Hungarian attention
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
- Graph-Context Attention Networks for Size-Varied Deep Graph Matching (CVPR 2022 · similarity 0.92)
- Deep Learning of Graph Matching (CVPR 2018 · similarity 0.91)
- Learning Partial Graph Matching via Optimal Partial Transport (ICLR 2025 · similarity 0.90)
- ResMatch: Residual Attention Learning for Feature Matching (AAAI 2024 · similarity 0.87)
- Discrete Cycle-Consistency Based Unsupervised Deep Graph Matching (AAAI 2024 · similarity 0.87)
- Charting the Design Space of Neural Graph Representations for Subgraph Matching (ICLR 2025 · similarity 0.86)
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.