Search Results for author:
Found 3 papers, 0 papers with code
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 is a general problem which translates into numerous application-specific unsupervised learning tasks.
Improved local search for graph edit distance
Among different classes of heuristic algorithms that were proposed to compute approximate solutions, local search based algorithms provide the tightest upper bounds for GED.
Generalized Median Graph via Iterative Alternate Minimizations
Computing a graph prototype may constitute a core element for clustering or classification tasks.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
