Titlebook: Algorithm Theory - SWAT ‘92; Third Scandinavian W Otto Nurmi,Esko Ukkonen Conference proceedings 1992 Springer-Verlag Berlin Heidelberg 199

Ejaculation

書目名稱Algorithm Theory - SWAT ‘92影響因子(影響力)




書目名稱Algorithm Theory - SWAT ‘92影響因子(影響力)學(xué)科排名




書目名稱Algorithm Theory - SWAT ‘92網(wǎng)絡(luò)公開度




書目名稱Algorithm Theory - SWAT ‘92網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Algorithm Theory - SWAT ‘92被引頻次




書目名稱Algorithm Theory - SWAT ‘92被引頻次學(xué)科排名




書目名稱Algorithm Theory - SWAT ‘92年度引用




書目名稱Algorithm Theory - SWAT ‘92年度引用學(xué)科排名




書目名稱Algorithm Theory - SWAT ‘92讀者反饋




書目名稱Algorithm Theory - SWAT ‘92讀者反饋學(xué)科排名

Paradox

Immunotherapy

infantile

An elementary approach to some analytic asymptotics,h as . The asymptotic behavior of . as .→∞ with . and . fixed depends on whether log ./ log . is rational or irrational. The solution of Fredman and Knuth used analytic methods in both cases, and used in particular the Wiener-Ikehara Tauberian theorem in the irrational case. We show that a more expl

否決

An optimal parallel algorithm for computing a near-optimal order of matrix multiplications,umber of operations. The best sequential algorithm for computing an optimal order of matrix multiplication runs in . log . time while the best known parallel NC algorithm runs in .(log..) time using ../ log.. processors. This paper presents the first approximating optimal parallel algorithm for this

harangue

,Generating sparse 2—spanners,the distance between any two vertices in . is larger than that distance in . by no more than a factor of .. This note concerns the problem of finding the sparsest 2-spanner in a given graph, and presents an approximation algorithm for this problem with approximation ratio log(.).

反饋

Parallel algorithm for cograph recognition with applications,RCW PRAM, where . and m are the number of vertices and edges of the graph. Using cotree representation, we obtain a parallel algorithm for the permutation representation problem for cographs using .(log .) time with . processors. We also present a parallel algorithm for the depthfirst spanning tree

demote

Crayon

擦掉

Parallel algorithms for priority queue operations,e Min-path Heap (MH), which is obtained as an extension of the traditional binary-heap organization. Using an MH, it is shown that insertion of a new item or deletion of the smallest item from a priority queue of . elements can be performed in . log n/p + log log .) parallel time, while construction