Suche
Anzeige der Einträge 1-1 von 1
Estimating Graph Edit Distance Using Lower and Upper Bounds of Bipartite Approximations
(2015-03-02)
International Journal of Pattern Recognition and Artificial Intelligence
The concept of graph edit distance (GED) is still one of the most flexible and powerful graph matching approaches available. Yet, exact computation of GED can be solved in exponential time complexity only. A previously ...
01 - Zeitschriftenartikel, Journalartikel oder Magazin