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. 2110.11335
  4. Cited By
Convex Joint Graph Matching and Clustering via Semidefinite Relaxations

Convex Joint Graph Matching and Clustering via Semidefinite Relaxations

21 October 2021
Maximilian Krahn
Florian Bernard
Vladislav Golyanik
ArXivPDFHTML

Papers citing "Convex Joint Graph Matching and Clustering via Semidefinite Relaxations"

14 / 14 papers shown
Title
Adiabatic Quantum Graph Matching with Permutation Matrix Constraints
Adiabatic Quantum Graph Matching with Permutation Matrix Constraints
Marcel Seelbach Benkner
Vladislav Golyanik
Christian Theobalt
Michael Moeller
55
34
0
08 Jul 2021
Deep Graph Matching via Blackbox Differentiation of Combinatorial
  Solvers
Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers
Michal Rolínek
Paul Swoboda
Dominik Zietlow
Anselm Paulus
Vít Musil
Georg Martius
56
113
0
25 Mar 2020
Deep Graph Matching Consensus
Deep Graph Matching Consensus
Matthias Fey
J. E. Lenssen
Christopher Morris
Jonathan Masci
Nils M. Kriege
63
210
0
27 Jan 2020
Convex Optimisation for Inverse Kinematics
Convex Optimisation for Inverse Kinematics
Tarun Yenamandra
Florian Bernard
Jiayi Wang
Franziska Mueller
Christian Theobalt
38
9
0
24 Oct 2019
Learning Combinatorial Embedding Networks for Deep Graph Matching
Learning Combinatorial Embedding Networks for Deep Graph Matching
Runzhong Wang
Junchi Yan
Xiaokang Yang
48
237
0
01 Apr 2019
VERSE: Versatile Graph Embeddings from Similarity Measures
VERSE: Versatile Graph Embeddings from Similarity Measures
Anton Tsitsulin
Davide Mottin
Panagiotis Karras
Emmanuel Müller
58
269
0
13 Mar 2018
DS*: Tighter Lifting-Free Convex Relaxations for Quadratic Matching
  Problems
DS*: Tighter Lifting-Free Convex Relaxations for Quadratic Matching Problems
Florian Bernard
Christian Theobalt
Michael Möller
70
43
0
29 Nov 2017
Joint Cuts and Matching of Partitions in One Graph
Joint Cuts and Matching of Partitions in One Graph
Tianshu Yu
Junchi Yan
Jieyi Zhao
Baoxin Li
18
13
0
27 Nov 2017
A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph
  Matching
A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching
Paul Swoboda
Carsten Rother
Hassan Abu Alhaija
Dagmar Kainmüller
Bogdan Savchynskyy
42
59
0
16 Dec 2016
Alternating Direction Graph Matching
Alternating Direction Graph Matching
Đ.Khuê Lê-Huu
Nikos Paragios
52
50
0
22 Nov 2016
Multicuts and Perturb & MAP for Probabilistic Graph Clustering
Multicuts and Perturb & MAP for Probabilistic Graph Clustering
Jörg H. Kappes
Paul Swoboda
Bogdan Savchynskyy
Tamir Hazan
Christoph Schnörr
20
7
0
09 Jan 2016
DeepWalk: Online Learning of Social Representations
DeepWalk: Online Learning of Social Representations
Bryan Perozzi
Rami Al-Rfou
Steven Skiena
HAI
254
9,789
0
26 Mar 2014
Spectral Clustering for Divide-and-Conquer Graph Matching
Spectral Clustering for Divide-and-Conquer Graph Matching
V. Lyzinski
D. Sussman
D. E. Fishkind
H. Pao
Li-Wei Chen
Joshua T. Vogelstein
Youngser Park
Carey E. Priebe
86
48
0
04 Oct 2013
A path following algorithm for the graph matching problem
A path following algorithm for the graph matching problem
M. Zaslavskiy
Francis R. Bach
Jean-Philippe Vert
138
422
0
23 Jan 2008
1