File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: On embedding rectangular grids in hypercubes.

TitleOn embedding rectangular grids in hypercubes.
Authors
Chan, MYChin, FYL
KeywordsDilation
embeddings
expansion
Gray codes
hyper cubes
Issue Date1988
PublisherI E E E. The Journal's web site is located at http://www.computer.org/tc
Citation
Ieee Transactions On Computers, 1988, v. 37 n. 10, p. 1285-1288 How to Cite?
DOI: http://dx.doi.org/10.1109/12.5991
AbstractThe following graph-embedding question is addressed: given a two-dimensional grid and the smallest hypercube with at least as many nodes as grid points, how can one assign grid points to hypercube nodes (with at most one grid point per node) so as to keep grid neighbors near each other in the cube? An embedding scheme for an infinite class of two-dimensional grids is given that keeps grid neighbors within a distance of two apart.
Persistent Identifierhttp://hdl.handle.net/10722/152227
ISSN
0018-9340
2021 Impact Factor: 3.183
2020 SCImago Journal Rankings: 0.679
ISI Accession Number ID
WOS:A1988Q294200014

 

DC FieldValueLanguage
dc.contributor.authorChan, MYen_US
dc.contributor.authorChin, FYLen_US
dc.date.accessioned2012-06-26T06:36:38Z-
dc.date.available2012-06-26T06:36:38Z-
dc.date.issued1988en_US
dc.identifier.citationIeee Transactions On Computers, 1988, v. 37 n. 10, p. 1285-1288en_US
dc.identifier.issn0018-9340en_US
dc.identifier.urihttp://hdl.handle.net/10722/152227-
dc.description.abstractThe following graph-embedding question is addressed: given a two-dimensional grid and the smallest hypercube with at least as many nodes as grid points, how can one assign grid points to hypercube nodes (with at most one grid point per node) so as to keep grid neighbors near each other in the cube? An embedding scheme for an infinite class of two-dimensional grids is given that keeps grid neighbors within a distance of two apart.en_US
dc.languageengen_US
dc.publisherI E E E. The Journal's web site is located at http://www.computer.org/tcen_US
dc.relation.ispartofIEEE Transactions on Computersen_US
dc.subjectDilation-
dc.subjectembeddings-
dc.subjectexpansion-
dc.subjectGray codes-
dc.subjecthyper cubes-
dc.titleOn embedding rectangular grids in hypercubes.en_US
dc.typeArticleen_US
dc.identifier.emailChin, FYL:chin@cs.hku.hken_US
dc.identifier.authorityChin, FYL=rp00105en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1109/12.5991en_US
dc.identifier.scopuseid_2-s2.0-0024091365en_US
dc.identifier.volume37en_US
dc.identifier.issue10en_US
dc.identifier.spage1285en_US
dc.identifier.epage1288en_US
dc.identifier.isiWOS:A1988Q294200014-
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridChan, MY=7402597863en_US
dc.identifier.scopusauthoridChin, FYL=7005101915en_US
dc.identifier.issnl0018-9340-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats