Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/1173| Title: | The efficiency of greedy routing in hypercubes and butterflies |
| Authors: | Tsitsiklis, John N. Massachusetts Institute of Technology. Laboratory for Information and Decision Systems. Stamoulis, George D. |
| Keywords: | TK7855.M41 E3845 no.1999 |
| Issue Date: | 1-Jun-2013 |
| Publisher: | Massachusetts Institute of Technology, Laboratory for Information and Decision Systems |
| Description: | by George D. Stamoulis and John N. Tsitsiklis. Includes bibliographical references (p. 24-26). Cover title. "October 1990". Research supported by the ARO. DAAL03-86-K-0171 Research supported by the NSF. ECS-8552419 |
| URI: | http://koha.mediu.edu.my:8181/jspui/handle/1721 |
| Other Identifiers: | http://hdl.handle.net/1721.1/1173 |
| Appears in Collections: | MIT Items |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.