File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Tight layout of the cube-connected cycles
Title | Tight layout of the cube-connected cycles |
---|---|
Authors | |
Issue Date | 1997 |
Citation | Proceedings Of The International Conference On High Performance Computing, Hipc, 1997, p. 422-427 How to Cite? |
Abstract | Preparata and Vuillemin proposed the cube-connected cycles (CCC) in 1981, and in the same paper, gave an asymptotically-optimal layout scheme for the CCC. We give a new layout scheme for the CCC which requires less than half of the area of the Preparata-Vuillemin layout. We also give a non-trivial lower bound on the layout area of the CCC. There is a constant factor of 2 between the new layout and the lower bound. We conjecture that the new layout is optimal (minimal). |
Persistent Identifier | http://hdl.handle.net/10722/151823 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chen, Guihai | en_US |
dc.contributor.author | Lau, Francis CM | en_US |
dc.date.accessioned | 2012-06-26T06:29:52Z | - |
dc.date.available | 2012-06-26T06:29:52Z | - |
dc.date.issued | 1997 | en_US |
dc.identifier.citation | Proceedings Of The International Conference On High Performance Computing, Hipc, 1997, p. 422-427 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/151823 | - |
dc.description.abstract | Preparata and Vuillemin proposed the cube-connected cycles (CCC) in 1981, and in the same paper, gave an asymptotically-optimal layout scheme for the CCC. We give a new layout scheme for the CCC which requires less than half of the area of the Preparata-Vuillemin layout. We also give a non-trivial lower bound on the layout area of the CCC. There is a constant factor of 2 between the new layout and the lower bound. We conjecture that the new layout is optimal (minimal). | en_US |
dc.language | eng | en_US |
dc.relation.ispartof | Proceedings of the International Conference on High Performance Computing, HiPC | en_US |
dc.title | Tight layout of the cube-connected cycles | en_US |
dc.type | Conference_Paper | en_US |
dc.identifier.email | Lau, Francis CM:fcmlau@cs.hku.hk | en_US |
dc.identifier.authority | Lau, Francis CM=rp00221 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.scopus | eid_2-s2.0-0031377989 | en_US |
dc.identifier.spage | 422 | en_US |
dc.identifier.epage | 427 | en_US |
dc.identifier.scopusauthorid | Chen, Guihai=7406537386 | en_US |
dc.identifier.scopusauthorid | Lau, Francis CM=7102749723 | en_US |