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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	13th Symposium on Integrated Circuits and Systems Design : proceedings : 18-24 September 2000, Manaus, Brazil S. 55
Hauptverfasser:	Okuda, K., Song, S. W.
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	Washington, DC, USA IEEE Computer Society 18.09.2000
Schriftenreihe:	ACM Conferences
Schlagworte:	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 hypercube disjoint Hamiltonian cycles interconnection network Hamiltonian decomposition edge set binary n-cube hypercube networks merge operator graph colouring
ISBN:	076950843X, 9780769508436
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!