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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	13th Symposium on Integrated Circuits and Systems Design : proceedings : 18-24 September 2000, Manaus, Brazil s. 55
Hlavní autori:	Okuda, K., Song, S. W.
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	Washington, DC, USA IEEE Computer Society 18.09.2000
Edícia:	ACM Conferences
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!