Measuring closeness of graphs -- the Hausdorff distance

DOI10.1007/S40840-015-0259-1zbMath1356.05094OpenAlexW2269339788MaRDI QIDQ506185

Andrej Taranenko, Iztok Banič

Publication date: 31 January 2017

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-015-0259-1

zbMATH Keywords

Hausdorff metricHausdorff distanceHausdorff graphs

Mathematics Subject Classification ID

Hyperspaces in general topology (54B20) Distance in graphs (05C12) Graph theory (05C99) Connectivity (05C40) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

Determining the Hausdorff Distance Between Trees in Polynomial Time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partial cubes are distance graphs
• Edge rotations and distance between graphs
• On distances between isomorphism classes of graphs
• A graph distance metric based on the maximal common subgraph
• Quasi‐median graphs and algebras

This page was built for publication: Measuring closeness of graphs -- the Hausdorff distance