Distance patterns in structural similarity

zbMATH Open1222.68350MaRDI QIDQ3174033FDOQ3174033

Authors: Thomas Kämpke 

Publication date: 12 October 2011

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

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

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)

Cited In (12)

• Two approaches to determining similarity of two digraphs
• An edit distance between graph correspondences
• Graph nodes and a definition of structural similarity
• On the use of similarity metrics for approximate graph matching
• Title not available (Why is that?)
• Subgraphs as a measure of similarity
• Graph similarity scoring and matching
• Exploration of the labelling space given graph edit distance costs
• Tools and Algorithms for the Construction and Analysis of Systems
• Title not available (Why is that?)
• Graph similarity and approximate isomorphism
• Some simple algorithms for structural comparison

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)