| Your search for 40198 returns 1568 document(s) |
| Complexity issues in VLSI: optimal layouts for the shuffle-exchange graph and other networks |
|
Author: Leighton, Frank Thomson; | Call Number: 621.395 Lei c | Type: Buku
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Discrete mathematics for computer scientists and mathematics second edition |
|
Author: Mott, Joe L.; | Call Number: 555.6 Mot d | Type: Buku
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| The Fast solution of three-dimensional fluid dynamical N-body problems using parallel tree codes: vortex element method and boundary element method, Hal. 301-306 |
|
Author: G.S. Winckelmans; J.K. Salmon; M.S. Warren; A. Leonard; | Call Number: SEM-229 | Type: Indeks Artikel prosiding/Sem
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Graph Theory and Combinatorial Structures: An O(log(n)4/3) Space Algorithm for (s,t) Connectivity in Undirected Graphs |
|
Author: R. Armoni, [et all] | Type: Indeks Artikel Jurnal
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Symbol recognition by error-tolerant subgraph matching between region adjacency graphs, page 1137 |
|
Author: J. Liados | Type: Indeks Artikel Jurnal
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Symbol recognition by error-tolerant subgraph matching between region adjacency graphs, page 1137 |
|
Author: J. Liados | Type: Indeks Artikel Jurnal
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Color-coding: a new method for finding simple paths,sycles and other small subgraphs within large graphs,Hal 326-335 |
|
Author: Noga Alon; | Call Number: SEM-202 | Type: Indeks Artikel prosiding/Sem
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| A Compile-time technique for controlling real-time execution of task-level data-flow graphs, Hal. II.49-II.56 |
|
Author: Shridhar Shukla and Brian Little; | Call Number: SEM-155 | Type: Indeks Artikel prosiding/Sem
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Maintaining longest paths in cyclic graphs, (LNCS-Lecture Notes in Computer Science 3709) Hal 358-372 |
|
Author: Irit Katriel; Pascal Van Hentenryck; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Parallel decomposition of distance-hereditary graphs, (LNCS-Lecture Notes in Computer Science 1557) Hal 417-426 |
|
Author: Sun-Yuan Hsieh; | Call Number: 004.35 Par | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Search Result