Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing [electronic resource] /
Thesis (Sarjana Kejuruteraan (Elektrik)) - Universiti Teknologi Malaysia, 2007
Main Author: | Ch'ng, Heng Sun |
---|---|
Format: | |
Language: | eng |
Published: |
Skudai : Universiti Teknologi Malaysia,
2007
|
Subjects: |
Similar Items
-
Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing /
by: Ch'ng, Heng Sun
Published: (2007) -
Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing
by: Ch'ng, Heng Sun
Published: (2007) -
Threaded block-parallel algorithm for finding the shortest paths on graph
by: O. N. Karasik, et al.
Published: (2019-06-01) -
The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph
by: Alexander Valeryevich Smirnov
Published: (2022-12-01) -
The Shortest Path Problem for a Multiple Graph
by: Alexander V. Smirnov
Published: (2017-12-01)