Logo image
Sign in
An O ( n log n ) Time Algorithm for Computing the Path-Length Distance Between Trees
Journal article   Open access   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)
19/06/2019

Abstract

url
Find in HALView

Metrics

1 Record Views

Details

Logo image