Titlebook: Algorithms; International Sympos Tetsuo Asano,Toshihide Ibaraki,Takao Nishizeki Conference proceedings 1990 Springer-Verlag Berlin Heidelbe

T-cell

書目名稱Algorithms影響因子(影響力)




書目名稱Algorithms影響因子(影響力)學(xué)科排名




書目名稱Algorithms網(wǎng)絡(luò)公開度




書目名稱Algorithms網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Algorithms被引頻次




書目名稱Algorithms被引頻次學(xué)科排名




書目名稱Algorithms年度引用




書目名稱Algorithms年度引用學(xué)科排名




書目名稱Algorithms讀者反饋




書目名稱Algorithms讀者反饋學(xué)科排名

GLOSS

Deceit

愚蠢人

The K-Gabriel graphs and their applications, set in .(...) time. The .-Gabriel graphs are also used to improve the running time of solving the Euclidean bottleneck biconnected edge subgraph problem from .(..) to 0(.), and that of solving the Euclidean bottleneck matching problem from .(..) to .(.....).

EXULT

激怒

Local tournaments and proper circular arc graphs,irable properties of tournaments. We illustrate this by giving .(.+. log.) algorithms to find a hamiltonian path and cycle in a local tournament. We mention several characterizations and recognition algorithms of graphs orientable as local tournaments. It turns out that they are precisely the graphs

發(fā)怨言

Two probabilistic results on merging,he worst case is significantly faster than any deterministic one in the range 1.618<.≤3. We extend it into a simple general algorithm which performs well for any ratio .. In particular, for .>1.618 it is significantly faster than binary merge. We also prove an average case lower bound for a wide cla

CULP

On the construction of abstract voronoi diagrams, II, ó‘ Dúnlaing [MMO] showed how to construct such diagrams in time .(. log .) by a randomized algorithm if the bisecting curves are in general position. In this paper we drop the general position assumption. Moreover, we show that the only geometric operation in the algoithm is the construction of a V

人工制品

Nebulizer