A prarallel algorithm to compute the shortest paths and diameter fo a graph and Its VLSI implementation

Simple item page
dc.contributor.authorSinha, Bhabani P
dc.contributor.authorBhattacharya, Bhargab B
dc.contributor.authorGhose, Suranjan
dc.contributor.authorSrimani, Pradip K
dc.date.accessioned2014-06-16T11:34:34Z
dc.date.available2014-06-16T11:34:34Z
dc.date.issued1986
dc.identifier.citationIEEE Transactions On Computer,V.35,No.11,P1000-1004en_US
dc.identifier.urihttp://hdl.handle.net/10263/5931
dc.language.isoenen_US
dc.subjectDiameteren_US
dc.subjectParallel algorithmsen_US
dc.subjectPipelining shortest pathen_US
dc.subjectVLSI architectureen_US
dc.titleA prarallel algorithm to compute the shortest paths and diameter fo a graph and Its VLSI implementationen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
ITONC-35-11-1986-P1000-1004.pdf
Size:
1.82 MB
Format:
Adobe Portable Document Format
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Computer Science