Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/14606
Title: | On a proposed divide-and-conquer minimal spanning tree algorithm | Authors: | Stojmenović, Ivan Langston M. |
Issue Date: | 1-Jan-1988 | Journal: | BIT | Abstract: | In a recent paper published in this journal, R. Chang and R. Lee purport to devise an O(N log N) time minimal spanning tree algorithm for N points in the plane that is based on a divide-and-conquer strategy using Voronoi diagrams. In this brief note, we present families of problem instances to show that the Chang-Lee worst-case timing analysis is incorrect, resulting in a time bound of O(N2 log N). Since it is known that alternate, truly O(N log N) time algorithms are available anyway, the general utility of the Chang-Lee algorithm is questionable. © 1988 BIT Foundations. | URI: | https://open.uns.ac.rs/handle/123456789/14606 | ISSN: | 00063835 | DOI: | 10.1007/BF01954898 |
Appears in Collections: | Naučne i umetničke publikacije |
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.