Computation of graph edit distance: Reasoning about optimality and speed-up
IMAGE AND VISION COMPUTING ; 40 ; 38-48
2015-01-01
11 pages
Aufsatz (Zeitschrift)
Englisch
DDC: | 621.367 |
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Approximate graph edit distance computation by means of bipartite graph matching
British Library Online Contents | 2009
|British Library Conference Proceedings | 1999
|Edit distance from graph spectra
IEEE | 2003
|Edit Distance from Graph Spectra
British Library Conference Proceedings | 2003
|Shape recognition based on Kernel-edit distance
British Library Online Contents | 2010
|