research
∙
07/30/2021
The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections [Extended Version]
The inference of minimum spanning arborescences within a set of objects ...
share
research
∙
07/05/2019
Improved local search for graph edit distance
Graph Edit Distance (GED) measures the dissimilarity between two graphs ...
research
∙
06/26/2019
