Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Charles A. Cusack"'
Publikováno v:
Discrete Applied Mathematics. 262:72-82
Given a simple, connected graph, a pebbling configuration (or just configuration) is a function from its vertex set to the nonnegative integers. A pebbling move between adjacent vertices removes two pebbles from one vertex and adds one pebble to the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ba512f9560f3644a84d29c64f310ac41
https://doi.org/10.1016/j.dam.2019.02.028
https://doi.org/10.1016/j.dam.2019.02.028
Publikováno v:
Discrete Mathematics. 342:777-783
Let G be a connected graph. A configuration of pebbles assigns a nonnegative integer number of pebbles to each vertex of G . A move consists of removing two pebbles from one vertex and placing one pebble on an adjacent vertex. A configuration is solv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1fc8241e01245bc8799ac672c8d8722f
https://doi.org/10.1016/j.disc.2018.10.030
https://doi.org/10.1016/j.disc.2018.10.030
Publikováno v:
Discrete Mathematics. 341:2686-2693
Let G be a connected graph. A configuration of pebbles on G is a function that assigns a nonnegative integer to each vertex. A pebbling move consists of removing two pebbles from one vertex and placing one pebble on an adjacent vertex. A configuratio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::66c7ae3be56c45e20097e926ec914624
https://doi.org/10.1016/j.disc.2018.06.028
https://doi.org/10.1016/j.disc.2018.06.028
Publikováno v:
Discrete Applied Mathematics. 172:62-74
Given a simple, connected graph, a pebbling configuration is a function from its vertex set to the nonnegative integers. A pebbling move between adjacent vertices removes two pebbles from one vertex and adds one pebble to the other. A vertex r is sai
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f7becb6200f992afc727fa44bc3a1670
https://doi.org/10.1016/j.dam.2014.03.008
https://doi.org/10.1016/j.dam.2014.03.008
Publikováno v:
SIAM Journal on Discrete Mathematics. 26:919-928
Given a simple, connected graph, a pebbling configuration is a function from its vertex set to the nonnegative integers. A pebbling move between adjacent vertices removes two pebbles from one vertex and adds one pebble to the other. A vertex $r$ is s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9058b6e86b7b4597d5a08af11e69ce01
https://doi.org/10.1137/11084412x
https://doi.org/10.1137/11084412x
Autor:
Charles A. Cusack, Airat Bekmetjev
Publikováno v:
SIAM Journal on Discrete Mathematics. 23:634-646
Consider a connected graph and a configuration of pebbles on its vertices. A pebbling step consists of removing two pebbles from a vertex and placing one on an adjacent vertex. A configuration is called solvable if it is possible to place a pebble on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::93e2126e578e7837f9ce9fa4752421f5
https://doi.org/10.1137/080724277
https://doi.org/10.1137/080724277
Autor:
Gretchen C. Foley, Charles A. Cusack
Publikováno v:
Computer Music Journal. 30:53-66
53 Music theorists face many challenges when analyzing music written according to George Perle’s compositional theory of twelve-tone tonality, a system based on inversional symmetry. Analysts focusing on Mr. Perle’s music seek relationships among
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::492217497761da1efc8b7a43aafbcd51
https://doi.org/10.1162/comj.2006.30.3.53
https://doi.org/10.1162/comj.2006.30.3.53
Publikováno v:
Designs, Codes and Cryptography. 18:81-87
We develop the notion of t-homogeneous, G-semiregular large sets of t-designs, show that there are infinitely many 3-homogeneous PSL(2, q)-semiregular large sets when q\equiv 3 \mod 4, two sporadic 3-homogeneous A \GammaL(1,32)-semiregular large sets
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f49cdfb5e2644a8d18e223840d4e9b46
https://doi.org/10.1023/a:1008381018661
https://doi.org/10.1023/a:1008381018661
Publikováno v:
Journal of Combinatorial Designs. 3:147-160
We determine the distribution of 3−(q + 1,k,λ) designs, with k ϵ {4,5}, among the orbits of k-element subsets under the action of PSL(2,q), for q ϵ 3 (mod 4), on the projective line. As a consequence, we give necessary and sufficient conditions
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::82c95b7634c7f6aa01def0be4a8e08bb
https://doi.org/10.1002/jcd.3180030207
https://doi.org/10.1002/jcd.3180030207
Publikováno v:
Future Play
Online casual games can be used to significantly enhance the productivity of volunteer computing. We call games which perform volunteer computing volunteer computing games. We introduce Wildfire Wally, a volunteer computing game capable of solving th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0d24aede02dd2cb612dd6771d2d6cc0f
https://doi.org/10.1145/1328202.1328250
https://doi.org/10.1145/1328202.1328250