A graph isomorphism algorithm for object recognition

DOI10.1007/BF01259368zbMath0911.68182MaRDI QIDQ1273874

K. Appert

Publication date: 6 January 1999

Published in: PAA. Pattern Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

object recognitiongraph isomorphism problem

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Pattern recognition, speech recognition (68T10) Parallel algorithms in computer science (68W10)

Related Items (5)

An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants ⋮ On the isomorphism of graphs having some eigenvalues of moderate multiplicity ⋮ A computational approach to construct a multivariate complete graph invariant ⋮ Isomorphism identification of graphs: especially for the graphs of kinematic chains ⋮ The SVE method for regular graph isomorphism identification

Cites Work

• Unnamed Item
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• A graph distance measure for image analysis
• On the Complexity of Canonical Labeling of Strongly Regular Graphs
• Random Graph Isomorphism
• The graph isomorphism disease
• Algorithmic Techniques for the Generation and Analysis of Strongly Regular Graphs and other Combinatorial Configurations
• An Efficient Algorithm for Graph Isomorphism

This page was built for publication: A graph isomorphism algorithm for object recognition