Solving inexact graph isomorphism problems using neural networks

Authors:
Brijnesh J. Jain;Fritz Wysotzki
Affiliations:
Department of Electrical Engineering and Computer Science, Technical University Berlin, Sekr. FR 5-8, Franklinstr. 28/29, D-10587 Berlin, Germany;Department of Electrical Engineering and Computer Science, Technical University Berlin, Sekr. FR 5-8, Franklinstr. 28/29, D-10587 Berlin, Germany
Venue:
Neurocomputing
Year:
2005

Citing 18
Cited 2

An Eigendecomposition Approach to Weighted Graph Matching Problems

IEEE Transactions on Pattern Analysis and Machine Intelligence
Constrained nets for graph matching and other quadratic assignment problems

Neural Computation
Isomorphism of Conflict Graphs in Multistage Interconnection Networks and its Application to Optimal Routing

IEEE Transactions on Computers
An Algorithm for Subgraph Isomorphism

Journal of the ACM (JACM)
Matching Hierarchical Structures Using Association Graphs

IEEE Transactions on Pattern Analysis and Machine Intelligence
Computer Vision

Computer Vision
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Comparing Structures Using a Hopfield-Style Neural Network

Applied Intelligence
Evolution towards the Maximum Clique

Journal of Global Optimization
A Linear Programming Approach for the Weighted Graph Matching Problem

IEEE Transactions on Pattern Analysis and Machine Intelligence
A RKHS Interpolator-Based Graph Matching Algorithm

IEEE Transactions on Pattern Analysis and Machine Intelligence
Replicator Equations, Maximal Cliques, and Graph Isomorphism

Neural Computation
A novel optimizing network architecture with applications

Neural Computation
A versatile computer-controlled assembly system

IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
A competitive winner-takes-all architecture for classification and pattern recognition of structures

GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
A PCA approach for fast retrieval of structural patterns inattributed graphs

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A Lagrangian relaxation network for graph matching

IEEE Transactions on Neural Networks
Approximating maximum clique with a Hopfield network

IEEE Transactions on Neural Networks

Fuzzy lattice reasoning (FLR) type neural computation for weighted graph partitioning

Neurocomputing
Towards the unification of structural and statistical pattern recognition

Pattern Recognition Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present a neural network approach to solve exact and inexact graph isomorphism problems for weighted graphs. In contrast to other neural heuristics or related methods this approach is based on a neural refinement procedure to reduce the search space followed by an energy-minimizing matching process. Experiments on random weighted graphs in the range of 100-5000 vertices and on chemical molecular structures are presented and discussed.