DSpace Repository
A prarallel algorithm to compute the shortest paths and diameter fo a graph and Its VLSI implementation
- DSpace Home
- →
- Scientific Contributions of ISI
- →
- Computer Science
- →
- View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Sinha, Bhabani P | |
| dc.contributor.author | Bhattacharya, Bhargab B | |
| dc.contributor.author | Ghose, Suranjan | |
| dc.contributor.author | Srimani, Pradip K | |
| dc.date.accessioned | 2014-06-16T11:34:34Z | |
| dc.date.available | 2014-06-16T11:34:34Z | |
| dc.date.issued | 1986 | |
| dc.identifier.citation | IEEE Transactions On Computer,V.35,No.11,P1000-1004 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10263/5931 | |
| dc.language.iso | en | en_US |
| dc.subject | Diameter | en_US |
| dc.subject | Parallel algorithms | en_US |
| dc.subject | Pipelining shortest path | en_US |
| dc.subject | VLSI architecture | en_US |
| dc.title | A prarallel algorithm to compute the shortest paths and diameter fo a graph and Its VLSI implementation | en_US |
| dc.type | Article | en_US |
