Referenced Items are not available for this document.
F.P. Preparata and J. Vuillemin (1981) proposed the cube connected cycles (CCC) 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)
Published in:
High-Performance Computing, 1997. Proceedings. Fourth International Conference on
Date of Conference: 18-21 Dec 1997
- Page(s):
- 422 - 427
- Meeting Date :
- 18 Dec 1997-21 Dec 1997
- Print ISBN:
- 0-8186-8067-9
- INSPEC Accession Number:
- 5767674
- Conference Location :
- Bangalore
- Digital Object Identifier :
- 10.1109/HIPC.1997.634524
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
