File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Tighter layouts of the cube-connected cycles

TitleTighter layouts of the cube-connected cycles
Authors
Issue Date2000
PublisherI E E E. The Journal's web site is located at http://www.computer.org/tpds
Citation
Ieee Transactions On Parallel And Distributed Systems, 2000, v. 11 n. 2, p. 182-191 How to Cite?
AbstractPreparata and Vuillemin proposed the cube-connected cycles (CCC) and its compact layout in 1981 [17]. We give a new layout of the CCC which uses less than half the area of the Preparata-Vuillemin layout. We also give a lower bound on the layout area of the CCC. The area of the new layout deviates from this bound by a small constant factor. If we 'unfold' the cycles in the CCC, the resulting structure can be laid out in optimal area.
Persistent Identifierhttp://hdl.handle.net/10722/43651
ISSN
2015 Impact Factor: 2.661
2015 SCImago Journal Rankings: 1.590
References

 

DC FieldValueLanguage
dc.contributor.authorChen, Gen_HK
dc.contributor.authorLau, FCMen_HK
dc.date.accessioned2007-03-23T04:51:17Z-
dc.date.available2007-03-23T04:51:17Z-
dc.date.issued2000en_HK
dc.identifier.citationIeee Transactions On Parallel And Distributed Systems, 2000, v. 11 n. 2, p. 182-191en_HK
dc.identifier.issn1045-9219en_HK
dc.identifier.urihttp://hdl.handle.net/10722/43651-
dc.description.abstractPreparata and Vuillemin proposed the cube-connected cycles (CCC) and its compact layout in 1981 [17]. We give a new layout of the CCC which uses less than half the area of the Preparata-Vuillemin layout. We also give a lower bound on the layout area of the CCC. The area of the new layout deviates from this bound by a small constant factor. If we 'unfold' the cycles in the CCC, the resulting structure can be laid out in optimal area.en_HK
dc.format.extent417425 bytes-
dc.format.extent26112 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/msword-
dc.languageengen_HK
dc.publisherI E E E. The Journal's web site is located at http://www.computer.org/tpdsen_HK
dc.relation.ispartofIEEE Transactions on Parallel and Distributed Systemsen_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©2000 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_HK
dc.titleTighter layouts of the cube-connected cyclesen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1045-9219&volume=11&issue=2&spage=182&epage=191&date=2000&atitle=Tighter+layouts+of+the+cube-connected+cyclesen_HK
dc.identifier.emailLau, FCM:fcmlau@cs.hku.hken_HK
dc.identifier.authorityLau, FCM=rp00221en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/71.841753en_HK
dc.identifier.scopuseid_2-s2.0-0033893654en_HK
dc.identifier.hkuros55362-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0033893654&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume11en_HK
dc.identifier.issue2en_HK
dc.identifier.spage182en_HK
dc.identifier.epage191en_HK
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridChen, G=7406537386en_HK
dc.identifier.scopusauthoridLau, FCM=7102749723en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats