Title :
Error correcting graph matching: on the influence of the underlying cost function
Author_Institution :
Inst. fur Inf. & Angewandte Math., Bern Univ., Switzerland
fDate :
9/1/1999 12:00:00 AM
Abstract :
Investigates the influence of the cost function on the optimal match between two graphs. It is shown that, for a given cost function, there are an infinite number of other cost functions that lead, for any given pair of graphs, to the same optimal error correcting matching. Furthermore, it is shown that well-known concepts from graph theory, such as graph isomorphism, subgraph isomorphism, and maximum common subgraph, are special cases of optimal error correcting graph matching under particular cost functions
Keywords :
computational complexity; graph theory; pattern matching; error correcting graph matching; graph isomorphism; maximum common subgraph; subgraph isomorphism; underlying cost function; Computer Society; Computer errors; Cost function; Databases; Distortion measurement; Error correction; Genetic algorithms; Neural networks; Pattern recognition; Simulated annealing;
Journal_Title :
Pattern Analysis and Machine Intelligence, IEEE Transactions on
