Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Fast computation of distances in a tree

Abstract : Computation of distances between two submits of a tree is an operation that occurs in some pattern recognition problem. When this operation has to be done thousands of times on millions of trees, the linear standard algorithms in OpN q for each pair may be a bottleneck to the global computation. This note present recursive spliting method with a complexity of OplogpN qq on each pair in worst case, and Op1q in average on all pair, once a pre-computation OpN logpN qq has been done on the whole tree. A commented C++ implementation is published as a companion to this note. 1
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download
Contributor : Marc Pierrot Deseilligny <>
Submitted on : Tuesday, May 5, 2020 - 4:15:36 PM
Last modification on : Wednesday, May 5, 2021 - 3:40:13 AM


Files produced by the author(s)


  • HAL Id : hal-02563859, version 1



Marc Deseilligny. Fast computation of distances in a tree. 2020. ⟨hal-02563859⟩



Record views


Files downloads