Distance patterns in structural similarity

MaRDI QIDQ3174033zbMATH OpenFDO

Authors Thomas Kämpke

Publication date 12 October 2011

Full work available at URL http://www.jmlr.org/papers/v7/kaempke06a.html

zbMATH Keywords

assignment problembest approximationbranch and boundinexact graph matchingmodel data base

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Graphical methods in statistics (62A09) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Algorithms for approximate graph matching
• Subgraphs as a measure of similarity
• Exploration of the labelling space given graph edit distance costs
• On the use of similarity metrics for approximate graph matching
• Isomorphism of (mis)Labeled Graphs

Cited in

(12)

• Graph similarity scoring and matching
• Graph similarity and approximate isomorphism
• Two approaches to determining similarity of two digraphs
• An edit distance between graph correspondences
• Subgraphs as a measure of similarity
• Tools and Algorithms for the Construction and Analysis of Systems
• scientific article; zbMATH DE number 2089760 (Why is no real title available?)
• Exploration of the labelling space given graph edit distance costs
• Some simple algorithms for structural comparison
• scientific article; zbMATH DE number 4049125 (Why is no real title available?)
• Graph nodes and a definition of structural similarity
• On the use of similarity metrics for approximate graph matching

This page was built for publication: Distance patterns in structural similarity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174033)