Efficient Suboptimal Graph Isomorphism
From MaRDI portal
Publication:3637695
DOI10.1007/978-3-642-02124-4_13zbMath1248.68442MaRDI QIDQ3637695
Peter J. C. Dickinson, Kaspar Riesen, Horst Bunke, Stefan Fankhauser
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
68R10: Graph theory (including graph drawing) in computer science
68T10: Pattern recognition, speech recognition
05C85: Graph algorithms (graph-theoretic aspects)
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
Uses Software
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item