Distance Measures for Embedded Graphs

@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}
}
  • Hugo A. Akitaya, M. Buchin, +2 authors C. Wenk
  • Published in ISAAC 2019
  • Mathematics, Computer Science
  • 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
    1 Citations

    References

    SHOWING 1-10 OF 24 REFERENCES
    Computing the Gromov-Hausdorff Distance for Metric Trees
    • 33
    • PDF
    A Path-Based Distance for Street Map Comparison
    • 18
    • PDF
    A Path-Based Distance for Street Map Comparison
    • 18
    • PDF
    Geometric graph matching and similarity: a probabilistic approach
    • 8
    • PDF
    Why Walking the Dog Takes Time: Frechet Distance Has No Strongly Subquadratic Algorithms Unless SETH Fails
    • K. Bringmann
    • Mathematics, Computer Science
    • 2014 IEEE 55th Annual Symposium on Foundations of Computer Science
    • 2014
    • 191
    • PDF
    Computing the Fréchet distance between two polygonal curves
    • H. Alt, M. Godau
    • Mathematics, Computer Science
    • Int. J. Comput. Geom. Appl.
    • 1995
    • 792
    • PDF
    Matching planar maps
    • 193
    • PDF
    Subgraph isomorphism in planar graphs and related problems
    • 479
    • PDF
    Measuring the Similarity of Geometric Graphs
    • 22
    • PDF