Accelerating graph algorithms with priority queue processor
Graphs are a pervasive data structure in computer science, and algorithms working with them are fundamental to the field. Of the various graph algorithms, techniques for searching a graph are the heart of graph algorithms. Many graph algorithms are organized as simple elaborations of basic graph sea...
Main Authors: | Heng Sun, Ch'ng (Author), Eik Wee, Chew (Author), Shaikh-Husin, Nasir (Author), Hani, Mohamed Khalil (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
School of Postgraduate Studies, UTM,
2006-07-26.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Nano-scale VLSI clock routing module based on useful-skew tree algorithm
by: Eik Wee, Chew, et al.
Published: (2006) -
Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing
by: Ch'ng, Heng Sun
Published: (2007) -
A computer aided design software module for clock tree synthesis in very large scale integration design
by: Chew, Eik Wee
Published: (2008) -
An optimization algorithm based on grid-graphs for minimizing interconnect delay in VLSI layout design
by: Mohd. Hani, Mohamed Khalil, et al.
Published: (2009) -
Algorithm to convert signal interpreted petri net models to programmable logic controller ladder logic diagram models
by: Aspar, Z., et al.
Published: (2018)