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 utilize 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.

翻译：Hausdorf 距离是比较图相似性的较新尺度。 Hausdorf 距离的概念是比较图的一类特殊的普通子集,取决于共同子集以外的结构属性。对于确定两棵树之间Hausdorf距离的问题,没有已知的有效算法,在本文件中,我们为此提供了一种多元时间算法。算法是递归性的,它利用了分裂和征服技术。作为一个子任务组,它也使用基于已知的图表算法的程序,以找到最大的两边匹配。