Suche
Anzeige der Einträge 1-2 von 2
Combining Bipartite Graph Matching and Beam Search for Graph Edit Distance Approximation
(Springer, 2014)
Artificial Neural Networks in Pattern Recognition - 6th IAPR TC 3 International Workshop, ANNPR 2014, Montreal, QC, Canada, October 6-8, 2014, Proceedings
Graph edit distance (GED) is a powerful and flexible graph dissimilarity model. Yet, exact computation of GED is an instance of a quadratic assignment problem and can thus be solved in exponential time complexity only. A ...
04B - Beitrag Konferenzschrift
Computing Upper and Lower Bounds of Graph Edit Distance in Cubic Time
(Springer, 2014)
Artificial Neural Networks in Pattern Recognition - 6th IAPR TC 3 International Workshop, ANNPR 2014, Montreal, QC, Canada, October 6-8, 2014. Proceedings
Exact computation of graph edit distance (GED) can be solved in exponential time complexity only. A previously introduced approximation framework reduces the computation of GED to an instance of a linear sum assignment ...
04B - Beitrag Konferenzschrift