A novel software toolkit for graph edit distance computation

DOI10.1007/978-3-642-38221-5_15MaRDI QIDQ4922158zbMATH OpenOpenAlexFDO

Authors Kaspar Riesen, Sandro Emmenegger, Horst Bunke

Publication date 28 May 2013

Published in Graph-Based Representations in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38221-5_15

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A survey of graph edit distance
• Approximation of graph edit distance in quadratic time
• Approximation of graph edit distance based on Hausdorff matching
• Improved Graph Edit Distance Approximation with Simulated Annealing
• Speeding up graph edit distance computation through fast bipartite matching

Cited in

(8)

• Approximation of graph edit distance based on Hausdorff matching
• Automatic learning of edit costs based on interactive and adaptive graph recognition
• scientific article; zbMATH DE number 2043358 (Why is no real title available?)
• scientific article; zbMATH DE number 2043363 (Why is no real title available?)
• Exact computation of graph edit distance for uniform and non-uniform metric edit costs
• scientific article; zbMATH DE number 6262292 (Why is no real title available?)
• Structural, Syntactic, and Statistical Pattern Recognition
• A survey of graph edit distance

Describes a project that uses

Uses Software

• igraph
• Graph Matching Toolkit

This page was built for publication: A novel software toolkit for graph edit distance computation

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