✦ LIBER ✦

Research problems on Gray codes and universal cycles

✍ Scribed by Brad Jackson; Brett Stevens; Glenn Hurlbert

Book ID: 108114142
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 423 KB
Volume: 309
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2009.04.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Monotone Gray codes and the middle level

Monotone Gray codes and the middle levels problem

✍ Carla D Savage; Peter Winkler 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 767 KB

Coordination of industry/government/univ

Coordination of industry/government/university research and code activities

✍ G.T. Kitz; G.E.O. Widera 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 417 KB

A note on gray code and odd-even merge

✍ Gerhard Larcher; Robert F. Tichy 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 216 KB

Communicated by R.E. Burkard Asymptotic results for the sum-of-digits function with respect to Standard-Gray-code representation of positive integers are established. These estimates yield two bounds for the average case complexity of Batcher's odd-even -merge.

On level-weight studies of binary and m-

On level-weight studies of binary and m-ary gray codes

✍ Bhu Dev Sharma; Ravinder Kumar Khanna 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 378 KB

University research on microelectronics

University research on microelectronics and on reliability

📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 155 KB

Extremal problems involving vertices and

Extremal problems involving vertices and edges on odd cycles

✍ P. Erdős; R.J. Faudree; C.C. Rousseau 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 603 KB

Erdiis, P., R.J. Faudree and C.C. Rousseau, Extremal problems involving vertices and edges on odd cycles, Discrete Mathematics 101 (1992) 23-31. We investigate the minimum, taken over all graphs G with n vertices and at least [n\*/4] + 1 edges, of the number of vertices and edges of G which are on c