Distance measures for geometric graphs

DOI10.1016/J.COMGEO.2023.102056MaRDI QIDQ6579116zbMATH OpenFDO

Authors Sushovan Majhi, Carola Wenk

Publication date 25 July 2024

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COMGEO.2023.102056

zbMATH Keywords

geometric graphsgraph comparisongraph edit distanceNP-hardness

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Distance measures for embedded graphs
• Matching planar maps
• A survey of graph edit distance
• scientific article; zbMATH DE number 2079389
• Comparing Graphs via Persistence Distortion

Cites work

• A distance measure between attributed relational graphs for pattern recognition
• An Efficient Algorithm for Graph Isomorphism
• Inexact graph matching for structural pattern recognition
• Map Construction Algorithms
• The earth mover's distance as a metric for image retrieval
• Tree Systems for Syntactic Pattern Recognition

Cited in

(1)

• Structural validation of synthetic power distribution networks using the multiscale flat norm

This page was built for publication: Distance measures for geometric graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6579116)