scientific article; zbMATH DE number 2043358
From MaRDI portal
Publication:4450795
zbMATH Open1040.68544MaRDI QIDQ4450795FDOQ4450795
Authors: R. Ambauen, Stefan G. Fischer, Horst Bunke 
Publication date: 16 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2726/27260095.htm
Title of this publication is not available (Why is that?)
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
- scientific article; zbMATH DE number 2043363
- Bipartite Graph Matching for Computing the Edit Distance of Graphs
- A novel software toolkit for graph edit distance computation
Pattern recognition, speech recognition (68T10) Graph theory (including graph drawing) in computer science (68R10)
Cited In (8)
- A distance measure for large graphs based on prime graphs
- Title not available (Why is that?)
- Approximation of graph edit distance based on Hausdorff matching
- GRAPH MATCHING A SKELETONIZED THEORETICAL MORPHOSPACE WITH A CLADOGRAM FOR GOMPHONEMOID-CYMBELLOID DIATOMS (BACILLARIOPHYTA)
- Title not available (Why is that?)
- On the subgraph epimorphism problem
- The graph matching problem
- Edit distance-based kernel functions for structural pattern classification
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4450795)
