File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Layout of the cube-connected cycles without long wires

TitleLayout of the cube-connected cycles without long wires
Authors
Issue Date2001
PublisherOxford University Press. The Journal's web site is located at http://comjnl.oxfordjournals.org/
Citation
Computer Journal, 2001, v. 44 n. 5, p. 374-383 How to Cite?
AbstractPreparata and Vuillemin proposed the cube-connected cycles (CCC) in 1981, and in the same paper gave an asymptotically-optimal layout scheme for the CCC. While all the known optimal layouts of the CCC, including the Preparata-Vuillemin layout, have long wires, we give a new layout scheme which has no long wires while keeping the asymptotically-optimal area. Hence, we can conclude that the CCC can be laid out optimally (within a constant factor) both in area and in wire length. We also show how large a constant-factor blow-up in area is needed in order not to produce any long wire in the layout.
Persistent Identifierhttp://hdl.handle.net/10722/89102
ISSN
2015 Impact Factor: 1.0
2015 SCImago Journal Rankings: 0.371
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorChen, Gen_HK
dc.contributor.authorLau, FCMen_HK
dc.date.accessioned2010-09-06T09:52:25Z-
dc.date.available2010-09-06T09:52:25Z-
dc.date.issued2001en_HK
dc.identifier.citationComputer Journal, 2001, v. 44 n. 5, p. 374-383en_HK
dc.identifier.issn0010-4620en_HK
dc.identifier.urihttp://hdl.handle.net/10722/89102-
dc.description.abstractPreparata and Vuillemin proposed the cube-connected cycles (CCC) in 1981, and in the same paper gave an asymptotically-optimal layout scheme for the CCC. While all the known optimal layouts of the CCC, including the Preparata-Vuillemin layout, have long wires, we give a new layout scheme which has no long wires while keeping the asymptotically-optimal area. Hence, we can conclude that the CCC can be laid out optimally (within a constant factor) both in area and in wire length. We also show how large a constant-factor blow-up in area is needed in order not to produce any long wire in the layout.en_HK
dc.languageengen_HK
dc.publisherOxford University Press. The Journal's web site is located at http://comjnl.oxfordjournals.org/en_HK
dc.relation.ispartofComputer Journalen_HK
dc.rightsThe Computer Journal. Copyright © Oxford University Press.en_HK
dc.titleLayout of the cube-connected cycles without long wiresen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0010-4620&volume=44&issue=5&spage=374&epage=383&date=2001&atitle=Layout+of+the+Cube-Connected+Cycles+Without+Long+Wiresen_HK
dc.identifier.emailLau, FCM:fcmlau@cs.hku.hken_HK
dc.identifier.authorityLau, FCM=rp00221en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1093/comjnl/44.5.374en_HK
dc.identifier.scopuseid_2-s2.0-0035653111en_HK
dc.identifier.hkuros71119en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0035653111&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume44en_HK
dc.identifier.issue5en_HK
dc.identifier.spage374en_HK
dc.identifier.epage383en_HK
dc.identifier.isiWOS:000171501400005-
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