Show simple item record

The efficiency of greedy routing in hypercubes and butterflies

dc.contributorMassachusetts Institute of Technology. Laboratory for Information and Decision Systems.
dc.contributorStamoulis, George D.
dc.contributorTsitsiklis, John N.
dc.date.accessioned2002-06-21T03:39:40Z
dc.date.available2002-06-21T03:39:40Z
dc.date.issued1990
dc.identifier.urihttp://hdl.handle.net/1721.1/1173
dc.descriptionIncludes bibliographical references (p. 24-26).en
dc.descriptionCover title. "October 1990".en
dc.description.sponsorshipResearch supported by the ARO. DAAL03-86-K-0171 Research supported by the NSF. ECS-8552419en
dc.description.statementofresponsibilityby George D. Stamoulis and John N. Tsitsiklis.
dc.format.extent31 p.
dc.format.mimetypeapplication/pdf
dc.language.isoeng
dc.publisherMassachusetts Institute of Technology, Laboratory for Information and Decision Systems
dc.relation.ispartofseriesLIDS-P ; 1999
dc.subject.lccTK7855.M41 E3845 no.1999
dc.titleThe efficiency of greedy routing in hypercubes and butterfliesen


Files in this item

Thumbnail
Name:
P-1999-22690124.pdf
Size:
2.241Mb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record