Matching graphs by pivoting

DOI10.1016/S0167-8655(02)00256-8MaRDI QIDQ4417662zbMATH OpenFDO

Authors Alessio Massaro, Marcello Pelillo

Publication date 29 July 2003

Published in Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0167-8655(02)00256-8

zbMATH Keywords

Graph matchingLinear complementarity problemMaximum cliqueMaximum common subgraphPivotingQuadratic programming

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computing methodologies for image processing (68U10)

Recommendations

• scientific article; zbMATH DE number 1844618
• scientific article; zbMATH DE number 1560350
• scientific article; zbMATH DE number 2043362
• The graph matching problem
• Lagrangian relaxation graph matching

Cited in

(9)

• Interactive graph-matching using active query strategies
• Maximum common induced subgraph parameterized by vertex cover
• Combinatorial and matrix methods for graph matching
• scientific article; zbMATH DE number 2043362 (Why is no real title available?)
• scientific article; zbMATH DE number 1560350 (Why is no real title available?)
• scientific article; zbMATH DE number 1844618 (Why is no real title available?)
• scientific article; zbMATH DE number 2090220 (Why is no real title available?)
• Active-learning query strategies applied to select a graph node given a graph labelling
• Graph polynomials from principal pivoting

This page was built for publication: Matching graphs by pivoting

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