Constraint-Based Graph Matching
Authors:
- 1 January 2009
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 274-288
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- A parametric filtering algorithm for the graph isomorphism problemConstraints, 2008
- A Path Following Algorithm for Graph Matching2008
- Filtering for Subgraph Isomorphism2007
- An Efficient Bounds Consistency Algorithm for the Global Cardinality ConstraintConstraints, 2005
- Reactive Tabu Search for Measuring Graph Similarity2005
- A large database of graphs and its use for benchmarking graph isomorphism algorithmsPattern Recognition Letters, 2003
- Constraint satisfaction algorithms for graph pattern matchingMathematical Structures in Computer Science, 2002
- On a relation between graph edit distance and maximum common subgraphPattern Recognition Letters, 1997
- A linear programming approach for the weighted graph matching problemIEEE Transactions on Pattern Analysis and Machine Intelligence, 1993
- An eigendecomposition approach to weighted graph matching problemsIEEE Transactions on Pattern Analysis and Machine Intelligence, 1988