Search Result Save to File Save as CSV
Your search for 12483 returns 4111 document(s)
Data Structure and Analysis of Algorithms; The Soft Heap: An Approximate Priority Queue with Optimal Error Rate, A minimum Spanning Tree Algorithm with Inverse-Ackermann Type Complexity
Author: B. Chazelle, [et all] | Type: Indeks Artikel Jurnal
Find Similar |  Add To Favorites |  Detail in New Window 
An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane,Hal 432-438
Author: Naven Garg; | Call Number: SEM-202 | Type: Indeks Artikel prosiding/Sem
Find Similar |  Add To Favorites |  Detail in New Window 
A minimum spanning tree clustering algorithm based on density, Hal. 3034-3037
Author: Sheng Yao; Ting Lou; Liji Lin, Chao Du, Weiwei Zhou, Lei Huang; | Call Number: SEM-302 | Type: Indeks Artikel prosiding/Sem
Find Similar |  Add To Favorites |  Detail in New Window 
Data Structure and Analysis of Algorithms : A Lower Bound on the Average-Case Complexity of Shellsort
Author: T. Jiang, [et all] | Type: Indeks Artikel Jurnal
Find Similar |  Add To Favorites |  Detail in New Window 
Data Structure and Analysis of Algorithms: Parallel RAMs with Owned Global Memory and Deterministic Context-Free Language Recognition, Minimum Cuts in Near-Linear Time
Author: P. W. Dymond, [et all] | Type: Indeks Artikel Jurnal
Find Similar |  Add To Favorites |  Detail in New Window 
Algoritma semut untuk pemecahan persoalan minimum spanning tree, Hal.16- 19
Author: Zainudin Zukhri; | Call Number: SEM-273 | Type: Indeks Artikel prosiding/Sem
Find Similar |  Add To Favorites |  Detail in New Window 
Penentuan Minimum Spanning Tree Suatu Komplit Graf dengan Menggunakan Algoritma Kruskal (51-56)
Author: Dian Rachmawati Ade Candra; | Call Number: SEM-312 | Type: Indeks Artikel prosiding/Sem
Find Similar |  Add To Favorites |  Detail in New Window 
A Randomized linear-time algorithm for finding minimum spanning trees,hal 9-15
Author: Philip N.Klein; | Call Number: SEM-202 | Type: Indeks Artikel prosiding/Sem
Find Similar |  Add To Favorites |  Detail in New Window 
A linear-work parallel algorithm for finding minimum spanning trees
Author: Richard Cole, Philip N. Klein, Robert E. Tarjan; | Call Number: SEM-212 | Type: Indeks Artikel prosiding/Sem
Find Similar |  Add To Favorites |  Detail in New Window 
Data Structure and Analysis of Algorithms: Speed Is as Powerful as Clairvoyance
Author: B. Kalyanasundaram, [et all] | Type: Indeks Artikel Jurnal
Find Similar |  Add To Favorites |  Detail in New Window 
Prev   1 2 3 4 5 6 7 8 9 10  Next