Combining Bipartite Graph Matching and Beam Search for Graph Edit Distance Approximation.
Kaspar RiesenAndreas FischerHorst BunkePublished in: ANNPR (2014)
Keyphrases
- beam search
- graph edit distance
- graph matching
- bipartite graph matching
- heuristic search
- search methods
- branch and bound
- edit distance
- search algorithm
- search problems
- pattern recognition
- matching algorithm
- object recognition
- bipartite graph
- pattern matching
- point sets
- ranking functions
- image matching
- neural network
- random walk
- approximation algorithms
- shape context