Titlebook: ;

打算

徹底明白

Exploration of the Labelling Space Given Graph Edit Distance Costs and we show that its minimization lead to a few different labellings and so, most of the labellings in the labelling space cannot be obtained. Moreover, we present a method that using some of the new properties of the Graph Edit Distance speeds up the computation of all possible labellings.

執(zhí)拗