Matching graphs by pivoting

Authors:
Alessio Massaro;Marcello Pelillo
Affiliations:
FEI Electron Optics, SEM Software Group, Building HAF13, Postbus 218, 5600MD Eindhoven, Netherlands;Dipartimento di Informatica, Università Ca' Foscari di Venezia, Via Torino 155, 30172 Venezia Mestre, Italy
Venue:
Pattern Recognition Letters - Special issue: Graph-based representations in pattern recognition
Year:
2003

Citing 9
Cited 4

A Graduated Assignment Algorithm for Graph Matching

IEEE Transactions on Pattern Analysis and Machine Intelligence
Structural Matching by Discrete Relaxation

IEEE Transactions on Pattern Analysis and Machine Intelligence
A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection

IEEE Transactions on Pattern Analysis and Machine Intelligence
Matching Hierarchical Structures Using Association Graphs

IEEE Transactions on Pattern Analysis and Machine Intelligence
Replicator equations, maximal cliques, and graph isomorphism

Neural Computation
A Complementary Pivoting Approach to the Maximum Weight Clique Problem

SIAM Journal on Optimization
Evolution towards the Maximum Clique

Journal of Global Optimization
Matching Free Trees, Maximal Cliques, and Monotone Game Dynamics

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Unifying Framework for Relational Structure Matching

ICPR '98 Proceedings of the 14th International Conference on Pattern Recognition-Volume 2 - Volume 2

Self-adapting numerical software and automatic tuning of heuristics

ICCS'03 Proceedings of the 2003 international conference on Computational science
Graph polynomials, principal pivoting, and maximum independent sets

GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
A new approach and faster exact methods for the maximum common subgraph problem

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Maximum common induced subgraph parameterized by vertex cover

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Motivated by a recent (continuous) quadratic formulation, in this paper we present a pivoting-based heuristic for graph matching based on the corresponding linear complementarity problem. Experiments are presented which demonstrate the potential of the proposed method.