View in EDS PDF Full Text

Optimal Enumeration of Ultrametric Furthest Pairs.

Saved in:
Bibliographic Details
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
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 193961054
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Optimal Enumeration of Ultrametric Furthest Pairs.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22CHEN%2C+HUI-TING%22">CHEN, HUI-TING</searchLink><relatesTo>1</relatesTo><i> yizen3@gmail.com</i><br /><searchLink fieldCode="AR" term="%22CHANG%2C+CHING-LUEH%22">CHANG, CHING-LUEH</searchLink><relatesTo>2</relatesTo><i> cichang@saturn.yzu.edu.tw</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+Information+Science+%26+Engineering%22">Journal of Information Science & Engineering</searchLink>. May2026, Vol. 42 Issue 3, p541-546. 6p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Deterministic+algorithms%22">Deterministic algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Metric+spaces%22">Metric spaces</searchLink><br /><searchLink fieldCode="DE" term="%22Time+complexity%22">Time complexity</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Optimization+algorithms%22">Optimization algorithms</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=193961054
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.6688/JISE.202605_42(3).0002
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 6
        StartPage: 541
    Subjects:
      – SubjectFull: Deterministic algorithms
        Type: general
      – SubjectFull: Metric spaces
        Type: general
      – SubjectFull: Time complexity
        Type: general
      – SubjectFull: Algorithms
        Type: general
      – SubjectFull: Optimization algorithms
        Type: general
    Titles:
      – TitleFull: Optimal Enumeration of Ultrametric Furthest Pairs.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: CHEN, HUI-TING
      – PersonEntity:
          Name:
            NameFull: CHANG, CHING-LUEH
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 05
              Text: May2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 10162364
          Numbering:
            – Type: volume
              Value: 42
            – Type: issue
              Value: 3
          Titles:
            – TitleFull: Journal of Information Science & Engineering
              Type: main
ResultId 1