Efficient Suboptimal Graph Isomorphism

DOI10.1007/978-3-642-02124-4_13zbMath1248.68442OpenAlexW1538934810MaRDI QIDQ3637695

Peter J. C. Dickinson, Kaspar Riesen, Stefan Fankhauser, Horst Bunke

Publication date: 14 July 2009

Published in: Graph-Based Representations in Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02124-4_13

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

On the complexity of submap isomorphism and maximum common submap problems

Uses Software

• nauty

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matching graphs with unique node labels
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• A graph distance measure for image analysis
• Algorithms for the Assignment and Transportation Problems
• An eigendecomposition approach to weighted graph matching problems
• An Algorithm for Subgraph Isomorphism
• Constraint satisfaction algorithms for graph pattern matching
• A Correspondence Measure for Graph Matching Using the Discrete Quantum Walk

This page was built for publication: Efficient Suboptimal Graph Isomorphism