Matching graphs by pivoting

DOI10.1016/S0167-8655(02)00256-8zbMath1028.68192MaRDI QIDQ4417662

Alessio Massaro, Marcello Pelillo

Publication date: 29 July 2003

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

zbMATH Keywords

Quadratic programmingLinear complementarity problemMaximum cliqueGraph matchingPivotingMaximum common subgraph

Mathematics Subject Classification ID

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

Related Items (2)

Graph polynomials from principal pivoting ⋮ Maximum common induced subgraph parameterized by vertex cover

This page was built for publication: Matching graphs by pivoting