ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1004.4965
  4. Cited By
Many-to-Many Graph Matching: a Continuous Relaxation Approach

Many-to-Many Graph Matching: a Continuous Relaxation Approach

28 April 2010
M. Zaslavskiy
Francis R. Bach
Jean-Philippe Vert
ArXiv (abs)PDFHTML

Papers citing "Many-to-Many Graph Matching: a Continuous Relaxation Approach"

3 / 3 papers shown
Title
Many-to-Many Matching via Sparsity Controlled Optimal Transport
Many-to-Many Matching via Sparsity Controlled Optimal Transport
Weijie Liu
Han Bao
M. Yamada
Zenan Huang
Nenggan Zheng
Hui Qian
OT
130
0
0
31 Mar 2025
Coronary Artery Semantic Labeling using Edge Attention Graph Matching
  Network
Coronary Artery Semantic Labeling using Edge Attention Graph Matching Network
Chen Zhao
Zhihui Xu
Guang-Uei Hung
Weihua Zhou
31
7
0
21 May 2023
Wasserstein-based Graph Alignment
Wasserstein-based Graph Alignment
Hermina Petric Maretic
Mireille El Gheche
Matthias Minder
Giovanni Chierchia
P. Frossard
OT
53
23
0
12 Mar 2020
1