A complementary pivoting approach to graph matching

DOI10.1007/3-540-44745-8_31MaRDI QIDQ4786059zbMATH OpenFDO

Authors Alessio Massaro, Marcello Pelillo

Publication date 12 December 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2134/21340469

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Machine vision and scene understanding (68T45) Computing methodologies and applications (68U99)

Recommendations

• Matching graphs by pivoting
• Combinatorial and matrix methods for graph matching
• scientific article; zbMATH DE number 568824
• Algorithms for approximate graph matching
• Graph Matching Based on Stochastic Perturbation
• Graph matching by simplified convex-concave relaxation procedure
• The graph matching problem

Cited in

(8)

• Seeking affinity structure: strategies for improving \(m\)-best graph matching
• Combinatorial and matrix methods for graph matching
• Subgraph Matching with Semidefinite Programming
• Matching graphs by pivoting
• scientific article; zbMATH DE number 2043362 (Why is no real title available?)
• scientific article; zbMATH DE number 1560350 (Why is no real title available?)
• Matching free trees, maximal cliques, and monotone game dynamics
• A quadratic penalty method for hypergraph matching

This page was built for publication: A complementary pivoting approach to graph matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4786059)