1 citations · 1 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2019
Upper Bounding the Graph Edit Distance Based on Rings and Machine Learning
David B. Blumenthal, Johann Gamper, Sébastien Bougleux +1
The graph edit distance (GED) is a flexible distance measure which is widely used for inexact graph matching. Since its exact computation is NP-hard, heuristics are used in practic…
cs.DS2018
Finding k-Dissimilar Paths with Minimum Collective Length
Theodoros Chondrogiannis, Panagiotis Bouros, Johann Gamper +2
Shortest path computation is a fundamental problem in road networks. However, in many real-world scenarios, determining solely the shortest path is not enough. In this paper, we st…