{"docId":8377,"paperId":6952,"url":"https:\/\/dmtcs.episciences.org\/6952","doi":"10.46298\/dmtcs.6952","journalName":"Discrete Mathematics & Theoretical Computer Science","issn":"","eissn":"1365-8050","volume":[{"vid":446,"name":"vol. 23, no. 3"}],"section":[{"sid":7,"title":"Discrete Algorithms","description":[]}],"repositoryName":"arXiv","repositoryIdentifier":"1907.01299","repositoryVersion":4,"repositoryLink":"https:\/\/arxiv.org\/abs\/1907.01299v4","dateSubmitted":"2020-12-02 10:04:10","dateAccepted":"2021-07-24 01:34:01","datePublished":"2021-08-19 17:29:10","titles":["Determining the Hausdorff Distance Between Trees in Polynomial Time"],"authors":["Kelenc, Aleksander"],"abstracts":["The Hausdorff distance is a relatively new measure of similarity of graphs. The notion of the Hausdorff distance considers a special kind of a common subgraph of the compared graphs and depends on the structural properties outside of the common subgraph. There was no known efficient algorithm for the problem of determining the Hausdorff distance between two trees, and in this paper we present a polynomial-time algorithm for it. The algorithm is recursive and it utilizes the divide and conquer technique. As a subtask it also uses the procedure that is based on the well known graph algorithm of finding the maximum bipartite matching."],"keywords":["Mathematics - Combinatorics","Computer Science - Discrete Mathematics","05C85, 05C05, 05C12, 05C70"]}