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

Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02163060
Contributor : Celine Scornavacca <>
Submitted on : Sunday, June 23, 2019 - 9:07:51 PM
Last modification on : Tuesday, June 25, 2019 - 1:53:45 AM

Identifiers

Collections

Citation

David Bryant, Celine Scornavacca. An O ( n log n ) Time Algorithm for Computing the Path-Length Distance Between Trees. Algorithmica, Springer Verlag, 2019, ⟨10.1007/s00453-019-00594-5⟩. ⟨hal-02163060⟩

Share

Metrics

Record views

74