High-Speed shortest path co-processor design
Shortest path algorithms are significant in graph theory and have been applied in many applications such as transportation and networking. Most of the shortest path calculation is performed on general purpose processor where instructions must be run to read the input, compute the result, and set the...
Saved in:
Main Authors: | Idris, Mohd Yamani Idna, Abu Bakar, Suraya, Tamil, Emran Mohd, Razak, Zaidi, Noor, Noorzaily Mohamed |
---|---|
Format: | Conference or Workshop Item |
Published: |
2009
|
Subjects: | |
Online Access: | http://eprints.um.edu.my/2287/ https://ieeexplore.ieee.org/document/5072059 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Improvements Over Two Phase Shortest Path Algorithm
by: Qureshi, M.A., et al.
Published: (2010) -
Shortest Path Trajectory System Based on Dijkstra Algorithm
by: Putri, Indah Pratiwi
Published: (2012) -
Prioritized Shortest Path Computation Mechanism (PSPCM) for wireless sensor networks
by: Onwuegbuzie, Innocent Uzougbo, et al.
Published: (2022) -
Intersection and Complement Set (IACS) Method to Reduce Redundant Node in Mobile WSN Localization
by: Harith, Muhammad Zar Mohd Zaid, et al.
Published: (2018) -
Two Phase Shortest Path Algorithm for Non-Negative Undirected Graphs
by: Qureshi, MA., et al.
Published: (2010)