Graph edit distance with node splitting and merging, and its application to diatom identification

DOI10.1007/3-540-45028-9_9MaRDI QIDQ4450795zbMATH OpenFDO

Authors R. Ambauen, Stefan G. Fischer, Horst Bunke

Publication date 16 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2726/27260095.htm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10)

Recommendations

• The edit distance in graphs: methods, results, and generalizations
• Structural pattern recognition with graph edit distance. Approximation algorithms and applications
• A survey of graph edit distance
• Graph matching using spectral seriation and string edit distance
• Bipartite Graph Matching for Computing the Edit Distance of Graphs
• A novel software toolkit for graph edit distance computation

Cited in

(8)

• Approximation of graph edit distance based on Hausdorff matching
• The graph matching problem
• Edit distance-based kernel functions for structural pattern classification
• GRAPH MATCHING A SKELETONIZED THEORETICAL MORPHOSPACE WITH A CLADOGRAM FOR GOMPHONEMOID-CYMBELLOID DIATOMS (BACILLARIOPHYTA)
• scientific article; zbMATH DE number 2090202 (Why is no real title available?)
• A distance measure for large graphs based on prime graphs
• scientific article; zbMATH DE number 6262292 (Why is no real title available?)
• On the subgraph epimorphism problem

This page was built for publication: Graph edit distance with node splitting and merging, and its application to diatom identification

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