Optimal Enumeration of Ultrametric Furthest Pairs.
Saved in:
| Title: | Optimal Enumeration of Ultrametric Furthest Pairs. |
|---|---|
| Authors: | CHEN, HUI-TING1 yizen3@gmail.com, CHANG, CHING-LUEH2 cichang@saturn.yzu.edu.tw |
| Source: | Journal of Information Science & Engineering. May2026, Vol. 42 Issue 3, p541-546. 6p. |
| Subjects: | Deterministic algorithms, Metric spaces, Time complexity, Algorithms, Optimization algorithms |
| Abstract: | Given an ultrametric space ({ 1, 2, ..., n}, d) (where n is given as input and d is provided as an oracle), Chen and Chang's [1] deterministic 0(F-1-n log n)-time algorithm enumerates all furthest pairs (without repetitions) in ({1,2,,n},d), where F denotes the number of furthest pairs. We show that their algorithm runs in 0(F) time. [ABSTRACT FROM AUTHOR] |
| Copyright of Journal of Information Science & Engineering is the property of Institute of Information Science, Academia Sinica and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
