@inproceedings{Akitaya2019DistanceMF,
title={Distance Measures for Embedded Graphs},
author={Hugo A. Akitaya and M. Buchin and Bernhard Kilgus and Stef Sijben and C. Wenk},
booktitle={ISAAC},
year={2019}
}

We introduce new distance measures for comparing straight-line embedded graphs based on the Fr\'echet distance and the weak Fr\'echet distance. These graph distances are defined using continuous mappings and thus take the combinatorial structure as well as the geometric embeddings of the graphs into account. We present a general algorithmic approach for computing these graph distances. Although we show that deciding the distances is NP-hard for general embedded graphs, we prove that our… CONTINUE READING