An $$O(n \log n)$$ O ( n log n ) Time Algorithm for Computing the Path-Length Distance Between Trees

David Bryant, CĂ©line Scornavacca. An $$O(n \log n)$$ O ( n log n ) Time Algorithm for Computing the Path-Length Distance Between Trees. Algorithmica, 81(9):3692-3706, 2019. [doi]

Abstract

Abstract is missing.