Approximate graph edit distance computation by means of bipartite graph matching
IMAGE AND VISION COMPUTING ; 27 , 7 ; 950-959
2009-01-01
10 pages
Article (Journal)
English
DDC: | 621.367 |
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
British Library Conference Proceedings | 1999
|Edit Distance from Graph Spectra
British Library Conference Proceedings | 2003
|Edit distance from graph spectra
IEEE | 2003
|Computation of graph edit distance: Reasoning about optimality and speed-up
British Library Online Contents | 2015
|