Sign in
An O ( n log n ) Time Algorithm for Computing the Path-Length Distance Between Trees
Journal article   Peer reviewed

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

David Bryant and Celine Scornavacca
Algorithmica, Vol.81(9), pp.3692-3706
16/09/2019

Abstract

Computer Science Data Structures and Algorithms Discrete Mathematics

Metrics

1 Record Views

Details

Usage Policy