Please use this identifier to cite or link to this item:
http://hdl.handle.net/10263/5931| Title: | A prarallel algorithm to compute the shortest paths and diameter fo a graph and Its VLSI implementation |
| Authors: | Sinha, Bhabani P Bhattacharya, Bhargab B Ghose, Suranjan Srimani, Pradip K |
| Keywords: | Diameter Parallel algorithms Pipelining shortest path VLSI architecture |
| Issue Date: | 1986 |
| Citation: | IEEE Transactions On Computer,V.35,No.11,P1000-1004 |
| URI: | http://hdl.handle.net/10263/5931 |
| Appears in Collections: | Computer Science |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| ITONC-35-11-1986-P1000-1004.pdf | 1.86 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.