DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chwa, Kyung Yong | ko |
dc.date.accessioned | 2013-02-27T15:24:14Z | - |
dc.date.available | 2013-02-27T15:24:14Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2000-01 | - |
dc.identifier.citation | JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, v.60, no.6, pp.775 - 783 | - |
dc.identifier.issn | 0743-7315 | - |
dc.identifier.uri | http://hdl.handle.net/10203/69328 | - |
dc.description.abstract | In this paper, we consider the embedding of multiple directed Hamiltonian rings into d-dimensional meshes M-d. Assuming two adjacent nodes in M-d are connected by two directed links with opposite directions, we aim to embed as many directed Hamiltonian rings as possible in a way that they are link-disjoint. In particular, we construct link-disjoint directed Hamiltonian rings in d-dimensional N-1 x ... x N-d mesh, where each N-i greater than or equal to 2d is even. (C) 2000 Academic Press. | - |
dc.language | English | - |
dc.publisher | Academic Press Inc Elsevier Science | - |
dc.subject | HYPERCUBES | - |
dc.subject | CYCLES | - |
dc.subject | GRAPHS | - |
dc.title | Optimal Embedding of Multiple Directed Hamiltonian Rings into d-dimensional Meshes | - |
dc.type | Article | - |
dc.identifier.wosid | 000087240100006 | - |
dc.identifier.scopusid | 2-s2.0-0042994114 | - |
dc.type.rims | ART | - |
dc.citation.volume | 60 | - |
dc.citation.issue | 6 | - |
dc.citation.beginningpage | 775 | - |
dc.citation.endingpage | 783 | - |
dc.citation.publicationname | JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING | - |
dc.contributor.localauthor | Chwa, Kyung Yong | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | ring embedding | - |
dc.subject.keywordAuthor | d-dimensional mesh | - |
dc.subject.keywordAuthor | directed Hamiltonian ring | - |
dc.subject.keywordPlus | HYPERCUBES | - |
dc.subject.keywordPlus | CYCLES | - |
dc.subject.keywordPlus | GRAPHS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.