| Article ID: | iaor19891167 |
| Country: | France |
| Volume: | 23 |
| Issue: | 4 |
| Start Page Number: | 393 |
| End Page Number: | 403 |
| Publication Date: | Dec 1989 |
| Journal: | RAIRO Operations Research |
| Authors: | Batbedat Andr |
A Diday’s algorithm gives the orientations of an ultrametric or an hierarchy. The paper deduces some remarkable properties for these orientations and it shows that they cannot be extended to the directly more general context of prepyramids and associated dissimilarities.