Research map / Graph learning / Graph algorithms and clustering
Layered Neighborhood Expansion for Incremental Multiple Graph Matching
Zixuan Chen, Zhihui Xie, Junchi Yan Yinqiang Zheng, 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
- Incremental Multi-graph Matching via Diversity and Randomness based Graph Clustering (ECCV 2018 · similarity 0.90)
- A Comparative Study of Graph Matching Algorithms in Computer Vision (ECCV 2022 · similarity 0.89)
- A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching (CVPR 2017 · similarity 0.88)
- A Convex Relaxation for Multi-Graph Matching (CVPR 2019 · similarity 0.87)
- Multiple Graph Matching and Clustering via Decayed Pairwise Matching Composition (AAAI 2020 · similarity 0.87)
- Graph Matching: Relax at Your Own Risk (TPAMI 2016 · similarity 0.87)
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.
