Revisiting Hamiltonian Decomposition of the Hypercube
A hypercube or binary n-cube is an interconnection network very suitable for implementing computing elements. In this paper we study the Hamiltonian decomposition, i.e. the partitioning of its edge set into Hamiltonian cycles. It is known that there are [n/2] disjoint Hamiltonian cycles on a binary...
Saved in:
| Published in: | 13th Symposium on Integrated Circuits and Systems Design : proceedings : 18-24 September 2000, Manaus, Brazil p. 55 |
|---|---|
| Main Authors: | , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
Washington, DC, USA
IEEE Computer Society
18.09.2000
|
| Series: | ACM Conferences |
| Subjects: | |
| ISBN: | 076950843X, 9780769508436 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | A hypercube or binary n-cube is an interconnection network very suitable for implementing computing elements. In this paper we study the Hamiltonian decomposition, i.e. the partitioning of its edge set into Hamiltonian cycles. It is known that there are [n/2] disjoint Hamiltonian cycles on a binary n-cube. The proof of this result, however, does not give rise to any simple construction algorithm of such cycles. In a previous work Song [1995] presented ideas towards a simple method to this problem. First decompose the hypercube into cycles of length 16, C/sub 16/, and then apply a merge operator to join the C/sub 16/ cycles into larger Hamiltonian cycles. The case of dimension n=6 (a 64-node hypercube) is illustrated. He conjectures the method can be generalized for any even n. In this paper, we generalize the first phase of that method for any even n and prove its correctness. Also we show four possible merge operators for the case of n=8 (a 256-node hypercube). This result can be viewed as a step toward the general merge operator, thus proving the conjecture. |
|---|---|
| AbstractList | A hypercube or binary n-cube is an interconnection network very suitable for implementing computing elements. In this paper we study the Hamiltonian decomposition, i.e. the partitioning of its edge set into Hamiltonian cycles. It is known that there are [n/2] disjoint Hamiltonian cycles on a binary n-cube. The proof of this result, however, does not give rise to any simple construction algorithm of such cycles. In a previous work Song [1995] presented ideas towards a simple method to this problem. First decompose the hypercube into cycles of length 16, C/ 16/, and then apply a merge operator to join the C/ 16/ cycles into larger Hamiltonian cycles. The case of dimension n=6 (a 64-node hypercube) is illustrated. He conjectures the method can be generalized for any even n. In this paper, we generalize the first phase of that method for any even n and prove its correctness. Also we show four possible merge operators for the case of n=8 (a 256-node hypercube). This result can be viewed as a step toward the general merge operator, thus proving the conjecture. A hypercube or binary n-cube is an interconnection network very suitable for implementing computing elements. In this paper we study the Hamiltonian decomposition, i.e. the partitioning of its edge set into Hamiltonian cycles. It is known that there are [n/2] disjoint Hamiltonian cycles on a binary n-cube. The proof of this result, however, does not give rise to any simple construction algorithm of such cycles. In a previous work Song [1995] presented ideas towards a simple method to this problem. First decompose the hypercube into cycles of length 16, C/sub 16/, and then apply a merge operator to join the C/sub 16/ cycles into larger Hamiltonian cycles. The case of dimension n=6 (a 64-node hypercube) is illustrated. He conjectures the method can be generalized for any even n. In this paper, we generalize the first phase of that method for any even n and prove its correctness. Also we show four possible merge operators for the case of n=8 (a 256-node hypercube). This result can be viewed as a step toward the general merge operator, thus proving the conjecture. |
| Author | Song, S. W. Okuda, K. |
| Author_xml | – sequence: 1 givenname: K. surname: Okuda fullname: Okuda, K. – sequence: 2 givenname: S. W. surname: Song fullname: Song, S. W. |
| BookMark | eNqFkDtPwzAUhS0BErR0ZM_ERIvfSUZUHkWqhIQ6sFnX7jUYErvEKRL_nlRhYOMsZzifzvBNyHFMEQm5YHShhlxXvORSLYYSgh-RCS11rWglxcspmeX8ToeIWomKnxH1jF8hhz7E12IFbWj6FAPE4hZdanfpsKRYJF_0b1isvnfYub3Fc3Liock4--0p2dzfbZar-frp4XF5s55DXcs5o456jw6c1p5V1EqwKLzYVhyoAyu33DFgjttKa0DpeKm3XilZMovAvJiSy_F216XPPebetCE7bBqImPbZCKaEZkoO4NUIgmuNTekjG0bNQYYZZZhRhrFdwD-__-DiB0bzYiw |
| ContentType | Conference Proceeding |
| Copyright | Copyright (c) 2000 Institute of Electrical and Electronics Engineers, Inc. All rights reserved. |
| Copyright_xml | – notice: Copyright (c) 2000 Institute of Electrical and Electronics Engineers, Inc. All rights reserved. |
| DBID | 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.5555/827245.827332 |
| DatabaseName | Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EndPage | 55 |
| Genre | Conference Paper |
| GroupedDBID | 6IE 6IK 6IL AAJGR AAVQY ACM ADPZR ALMA_UNASSIGNED_HOLDINGS APO BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK GUFHI IERZE LHSKQ OCL RIB RIC RIE RIL 7SC 8FD AAWTH JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-a994-10c0ffecac66f180b4abe3f3d82a0cab4d2c1a1c2b866ae4c276df55471bea1f3 |
| ISBN | 076950843X 9780769508436 |
| IngestDate | Fri Jul 11 12:35:05 EDT 2025 Wed Jan 31 06:50:03 EST 2024 Sun Dec 01 06:31:10 EST 2024 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Keywords | hypercube disjoint Hamiltonian cycles interconnection network Hamiltonian decomposition edge set binary n-cube hypercube networks merge operator graph colouring |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-a994-10c0ffecac66f180b4abe3f3d82a0cab4d2c1a1c2b866ae4c276df55471bea1f3 |
| Notes | SourceType-Conference Papers & Proceedings-1 ObjectType-Conference Paper-1 content type line 25 |
| PQID | 31536154 |
| PQPubID | 23500 |
| PageCount | 1 |
| ParticipantIDs | acm_books_10_5555_827245_827332_brief acm_books_10_5555_827245_827332 proquest_miscellaneous_31536154 |
| PublicationCentury | 2000 |
| PublicationDate | 20000918 |
| PublicationDateYYYYMMDD | 2000-09-18 |
| PublicationDate_xml | – month: 09 year: 2000 text: 20000918 day: 18 |
| PublicationDecade | 2000 |
| PublicationPlace | Washington, DC, USA |
| PublicationPlace_xml | – name: Washington, DC, USA |
| PublicationSeriesTitle | ACM Conferences |
| PublicationTitle | 13th Symposium on Integrated Circuits and Systems Design : proceedings : 18-24 September 2000, Manaus, Brazil |
| PublicationYear | 2000 |
| Publisher | IEEE Computer Society |
| Publisher_xml | – name: IEEE Computer Society |
| SSID | ssj0000395382 |
| Score | 1.2855898 |
| Snippet | A hypercube or binary n-cube is an interconnection network very suitable for implementing computing elements. In this paper we study the Hamiltonian... |
| SourceID | proquest acm |
| SourceType | Aggregation Database Publisher |
| StartPage | 55 |
| SubjectTerms | Mathematics of computing Mathematics of computing -- Discrete mathematics Mathematics of computing -- Discrete mathematics -- Combinatorics Mathematics of computing -- Discrete mathematics -- Combinatorics -- Combinatorial algorithms Mathematics of computing -- Discrete mathematics -- Graph theory Mathematics of computing -- Discrete mathematics -- Graph theory -- Network flows |
| Title | Revisiting Hamiltonian Decomposition of the Hypercube |
| URI | https://www.proquest.com/docview/31536154 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3db9MwELfYxAM88THExlcegJcpYMdunDyPTUWaukkLUt8s27FFhZqWpEGDv567OEnXgTTxQB_SyrKsy-_c8_n88x0hbzn1tOTMxdQbHQtLfZyb3MbOaZF7Cq1Z2RWbkLNZNp_nl32J-6YrJyCrKru-ztf_VdXQBsrGq7P_oO5xUGiA36B0eILa4XnLI_7r4sP45uvx1c8lsrHaJZ4FfB4yQpTHJ4vatnhU0BE2Q7JyMDlI4uhiA9sRmxArgJcWYE_W0NG4GvMP0nDDp9JtE-aG_jWwNPo039199Y5NPcXoCTiXaEQ-OWSv9xSxgZkwhV0wSGTG2XXxrS31bvS15wxfBSrgGKGgSKcYjWrYqFKZYrlZEZKd3DbbE_gArFkiEzH5AF-8j3nupMeeXaizL-fnqjidF-_X32OsHIYn7H0ZlT2yJyULN_jGKBvlOVj0Pl4TJBjSLo0ShcyrKMPHHQnQX7HLP9bozvEoHpGD7ZXM6HLUzmNyz1VPyMMb2SSfkskW-egG8tEO8tHKR4B8NCJ_QIqz0-JkGvdVMWKNaZwZhf-Td1bbNPUso0Zo47jnZZZoarURZWKZZjYxWZpqJ2wi09KD0yiZcZp5_ozsV6vKPScR5ykXqbNSZkYYqnNtS-hrnJg4A47pIXkDACic242CzSJCpAJEKkB0SN7d0UOZeuE8jDSAqMB84ZmUrtyqbRSHFRecanF0Z48X5MF2cr0k-5u6da_Ifftjs2jq153afwPeCF-d |
| linkProvider | IEEE |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=13th+Symposium+on+Integrated+Circuits+and+Systems+Design+%3A+proceedings+%3A+18-24+September+2000%2C+Manaus%2C+Brazil&rft.atitle=Revisiting+Hamiltonian+Decomposition+of+the+Hypercube&rft.au=Okuda%2C+K&rft.au=Song%2C+S+W&rft.date=2000-09-18&rft.isbn=9780769508436&rft_id=info:doi/10.5555%2F827245.827332&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769508436/lc.gif&client=summon&freeimage=true |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769508436/mc.gif&client=summon&freeimage=true |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769508436/sc.gif&client=summon&freeimage=true |