Computing the Fréchet distance of trees and graphs of bounded tree width

Abstract

We give algorithms to compute the Fréchet distance of trees and graphs with bounded tree width. Our algorithms run in O(n 2 ) time for trees of bounded degree, and O(n 2 √ n log n) time for trees of arbitrary degree. For graphs of bounded tree width we show one can compute the Fréchet distance in FPT (fixed parameter tractable) time. ACM Subject Classification Theory of computation → Design and analysis of algorithmsKeywords and phrases Fréchet distance, trees, bounded tree width, graph isomorphism