Zobrazeno 1 - 3
of 3
pro vyhledávání: '"J. S. Salowe"'
Autor:
J. S. Salowe, Dana Richards
Publikováno v:
Algorithmica. 7:247-276
Ak-extremal point set is a point set on the boundary of ak-sided rectilinear convex hull. Given ak-extremal point set of sizen, we present an algorithm that computes a rectilinear Steiner minimal tree in timeO(k 4 n). For constantk, this algorithm ru
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9b5c52b710f2d4a278390df29ed4b10e
https://doi.org/10.1007/bf01758761
https://doi.org/10.1007/bf01758761
Publikováno v:
BIT. 30:220-234
In this paper, we describe an algorithm to stably sort an array ofn elements using only a linear number of data movements and constant extra space, albeit in quadratic time. It was not known previously whether such an algorithm existed. When the inpu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9b0d59757a1a627065eb37133e75cb9a
https://doi.org/10.1007/bf02017344
https://doi.org/10.1007/bf02017344
Autor:
J. S. Salowe
Publikováno v:
Information Processing Letters. 42:151-152
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e3dfd93d89c4548ed0822b012fd6958b
https://doi.org/10.1016/0020-0190(92)90139-m
https://doi.org/10.1016/0020-0190(92)90139-m