A Constant-Time Algorithm for Middle Levels Gray Codes

For any integer  n ≥ 1 , a middle levels Gray code is a cyclic listing of all n -element and ( n + 1 ) -element subsets of { 1 , 2 , … , 2 n + 1 } such that any two consecutive sets differ in adding or removing a single element. The question whether such a Gray code exists for any  n ≥ 1 has been th...

Celý popis

Podrobná bibliografia

Vydané v:	Algorithmica Ročník 82; číslo 5; s. 1239 - 1258
Hlavní autori:	Mütze, Torsten, Nummenpalo, Jerri
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.05.2020 Springer Nature B.V
Predmet:	Algorithm Analysis and Problem Complexity Algorithms Binary codes Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Mathematics of Computing Theory of Computation Hamilton cycle Gray code Middle levels conjecture
ISSN:	0178-4617, 1432-0541
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!