Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Tom Whaley"'
Publikováno v:
Electronic Notes in Discrete Mathematics. 11:218-232
In 1976 Molluzzo asked for the conditions on a generating string of a Steinhaus graph that would guarantee that its complement would be connected. In this paper we give conditions that guarantee that the complement is not connected and a recursion, f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::126f355cca0d24bc4875e5184c590aac
https://doi.org/10.1016/s1571-0653(04)00067-8
https://doi.org/10.1016/s1571-0653(04)00067-8
Autor:
Wayne M. Dymacek, Tom Whaley
Publikováno v:
Discrete Mathematics. 141:95-107
Let b ( n ) be the number of bipartite Steinhaus graphs with n vertices. We show that b ( n ) satisfies the recurrence, b (2) = 2, b (3) = 4, and for k ⩾ 2, b (2 k + 1) = 2 b ( k + 1) + 1, b (2 k ) = b ( k ) + b ( k + 1). Thus b(n) ⩽ 5 2 n − 7
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bac2cbc1ef45b9107a10820597fb0cd6
https://doi.org/10.1016/0012-365x(93)e0211-l
https://doi.org/10.1016/0012-365x(93)e0211-l
Publikováno v:
The Journal of Military History. 67:921-923
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::80fdd9a90e0b1d1e86bd91c163c37f56
https://doi.org/10.1353/jmh.2003.0254
https://doi.org/10.1353/jmh.2003.0254
Autor:
Tom Whaley
Publikováno v:
Computer Science Education. 3:189-202
This article proposes a unit on program verification that could be included in are intermediate‐level undergraduate course. A linked cursor implementation within an array for the binary search tree abstract data type (ADT) is used ASA case study. T
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::70293d07af5ff1cb1a505d502c494075
https://doi.org/10.1080/0899340920030208
https://doi.org/10.1080/0899340920030208
Autor:
Tom Whaley
Publikováno v:
SIGCSE
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4ebb3445e123a29c1c61bfca3f32ad04
https://doi.org/10.1145/107005.107027
https://doi.org/10.1145/107005.107027
Autor:
Tom Whaley
Publikováno v:
Information Processing Letters. 41:239-241
Feijen, van Gasteren, and Gries (1987) give a formal development of an algorithm to invert a cyclic permutation stored in an array, and Xue and Gries (1988) give such a development for an algorithm to cube a cyclic permutation. These derivations are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fcfb1479949e21edd6f2df8a7635d536
https://doi.org/10.1016/0020-0190(92)90166-s
https://doi.org/10.1016/0020-0190(92)90166-s
Publikováno v:
ACM Southeast Regional Conference
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::23c21aea4a5f17c9ba59535d53c2715b
https://doi.org/10.1145/275295.275371
https://doi.org/10.1145/275295.275371
Publikováno v:
SIGCSE
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4dc1ee2356e57e49a4817c2f2a713c46
https://doi.org/10.1145/191029.191172
https://doi.org/10.1145/191029.191172
Publikováno v:
International Journal of Nuclear Knowledge Management. 3:37
The issues associated with nuclear energy and security encompass a broad range of topics from diverse disciplines. This diversity often makes it difficult to locate reliable sources of information on these important topics. The Alsos Digital Library
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7e488724d915c4ad48a49b0bee1d84bd
https://doi.org/10.1504/ijnkm.2008.018937
https://doi.org/10.1504/ijnkm.2008.018937
Autor:
Yueh-Shin Lee, Wayne M. Dymacek, Tom Whaley, Bhaskar DasGupta, Gerard J. Chang, Martin Füruer, Matthew Koerlin
Publikováno v:
Scopus-Elsevier
We characterize bipartite Steinhaus graphs in three ways by partitioning them into four classes and we describe the color sets for each of these classes. An interesting recursion had previously been given for the number of bipartite Steinhaus graphs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e43b16ccbab9ac0db3e6b52789706e81