| Your search for 35932 returns 501 document(s) |
| Graph connectivity in electrical studies, HAL. 1047-1052 |
|
Author: Ford Lumban Gaol; Belawati Wijaya; | Call Number: SEM-289 | Type: Indeks Artikel prosiding/Sem
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Graph connectivity electrical studies |
|
Author: Ford Lumban Gaol & Belawati Wijaya | Call Number: Pub.Staf-JI-0010 | Type: Jurnal Internasional
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Graph connectivity in electrical studies, page 194-200 |
|
Author: Ford LumbanGaol and Belawati Widjaja | Type: Indeks Artikel Jurnal
|
|
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
|
| Algorithms in c part 5 : graph algorithms 3rd ed./ Robert Sedgewick |
|
Author: Sedgewick, Robert; | Call Number: 005.133 Sed a | Type: Buku
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Data structures and algorithms 2: graph algorithms and NP-completeness/Kurt Mehlhorn |
|
Author: Mehlhorn, Kurt; | Call Number: 511.8 Meh d | Type: Buku
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| An effective memetic algorithm for VLSI partitioning problem, HAL. 667-670 |
|
Author: P. Subbaraj, K. Sivasundari; P. Siva Kumar; | Call Number: SEM-289 | Type: Indeks Artikel prosiding/Sem
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Algoritma pewarnaan edge pada bipartite graph |
|
Author: Suprapto; | Call Number: T-0203 | Edition: 1990 | Type: Tesis
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| The connectivity carcass of a vertex subset in a graph and its incremental maintenance,Hal 716-725 |
|
Author: Ye.Dinitz and A.Vainshtein; | Call Number: SEM-202 | Type: Indeks Artikel prosiding/Sem
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Algorithms for drawing planar graph/Goosen Kant |
|
Author: Kant, Goossen; | Call Number: 005.12 Kan a | Type: Buku
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Search Result