Graph matching using spectral seriation and string edit distance

DOI10.1007/3-540-45028-9_14MaRDI QIDQ4450801zbMATH OpenFDO

Authors Antonio Robles-Kelly, Edwin R. Hancock

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/27260154.htm

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2090203
• Bipartite Graph Matching for Computing the Edit Distance of Graphs
• Speeding up graph edit distance computation through fast bipartite matching
• A novel software toolkit for graph edit distance computation
• A survey of graph edit distance

Cited in

(5)

• Graph matching using the interference of continuous-time quantum walks
• Credible seed identification for large-scale structural network alignment
• Graph edit distance with node splitting and merging, and its application to diatom identification
• scientific article; zbMATH DE number 2090203 (Why is no real title available?)
• Image categorization: Graph edit distance \(+\) edge direction histogram

This page was built for publication: Graph matching using spectral seriation and string edit distance

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