A novel software toolkit for graph edit distance computation

DOI10.1007/978-3-642-38221-5_15zbMATH Open1382.68180OpenAlexW74055483MaRDI QIDQ4922158FDOQ4922158

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

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

Mathematics Subject Classification ID

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

Cited In (8)

• Structural, Syntactic, and Statistical Pattern Recognition
• A survey of graph edit distance
• Title not available (Why is that?)
• Automatic learning of edit costs based on interactive and adaptive graph recognition
• Exact computation of graph edit distance for uniform and non-uniform metric edit costs
• Approximation of graph edit distance based on Hausdorff matching
• Title not available (Why is that?)
• Title not available (Why is that?)

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)