Determining the Hausdorff Distance Between Trees in Polynomial Time

DOI10.46298/dmtcs.6952zbMath1486.05075arXiv1907.01299OpenAlexW3195892102MaRDI QIDQ5024666

Aleksander Kelenc

Publication date: 27 January 2022

Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.01299

zbMATH Keywords

treesgraph algorithmsHausdorff distancegraph similarity

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Measuring closeness of graphs -- the Hausdorff distance
• A survey of graph edit distance
• Edge rotations and distance between graphs
• On distances between isomorphism classes of graphs
• A graph distance metric based on the maximal common subgraph
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: Determining the Hausdorff Distance Between Trees in Polynomial Time