The efficiency of greedy routing in hypercubes and butterflies

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/1173

Full metadata record

DC Field	Value	Language
dc.contributor	Tsitsiklis, John N.	-
dc.contributor	Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.	-
dc.contributor	Stamoulis, George D.	-
dc.date	2002-06-21T03:39:40Z	-
dc.date	2002-06-21T03:39:40Z	-
dc.date	1990	-
dc.date.accessioned	2013-05-31T16:11:04Z	-
dc.date.available	2013-05-31T16:11:04Z	-
dc.date.issued	2013-06-01	-
dc.identifier	http://hdl.handle.net/1721.1/1173	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/jspui/handle/1721	-
dc.description	by George D. Stamoulis and John N. Tsitsiklis.	-
dc.description	Includes bibliographical references (p. 24-26).	-
dc.description	Cover title. "October 1990".	-
dc.description	Research supported by the ARO. DAAL03-86-K-0171 Research supported by the NSF. ECS-8552419	-
dc.format	31 p.	-
dc.format	application/pdf	-
dc.language	eng	-
dc.publisher	Massachusetts Institute of Technology, Laboratory for Information and Decision Systems	-
dc.relation	LIDS-P ; 1999	-
dc.subject	TK7855.M41 E3845 no.1999	-
dc.title	The efficiency of greedy routing in hypercubes and butterflies	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI