Zobrazeno 1 - 10
of 415
pro vyhledávání: '"Charles J. Colbourn"'
Autor:
Charles J. Colbourn
Publikováno v:
Le Matematiche, Vol 59, Iss 1,2, Pp 125-172 (2004)
Covering arrays generalize orthogonal arrays by requiring that t -tuples be covered, but not requiring that the appearance of t -tuples be balanced.Their uses in screening experiments has found application in software testing, hardware testing, and a
Externí odkaz:
https://doaj.org/article/0a62f2aeb2e44e1d9a32d43c672193e8
Autor:
Charles J. Colbourn, Gordon F. Royle
Publikováno v:
Le Matematiche, Vol 45, Iss 1, Pp 39-60 (1990)
The spectrum of possible numbers of repeated blocks in (ν,4,2) designs is determined for all ν⩾121.
Externí odkaz:
https://doaj.org/article/f6c80e8e830e4190bf6ec4665071a6d0
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 5, Iss 4, Pp 823-825 (1982)
The number of colours needed to colour the blocks of a cyclic Steiner 2-design S(2,k,v) is at most v.
Externí odkaz:
https://doaj.org/article/bb74a57a77ed4854893ac9adcdc2807e
Publikováno v:
2023 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW).
Publikováno v:
Journal of Combinatorial Optimization. 45
Autor:
Charles J. Colbourn
Publikováno v:
Designs, Codes and Cryptography. 89:2373-2395
For an ordering of the blocks of a design, the point sum of an element is the sum of the indices of blocks containing that element. Block labelling for popularity asks for the point sums to be as equal as possible. For Steiner systems of order v and
Autor:
Dylan Lusi, Charles J. Colbourn
Publikováno v:
Discrete Mathematics. 346:113396
Autor:
Jason I. Brown, Charles J. Colbourn
Publikováno v:
Handbook of the Tutte Polynomial and Related Topics ISBN: 9780429161612
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ca7826ed61d0468f5b28ec3a06a059a1
https://doi.org/10.1201/9780429161612-15
https://doi.org/10.1201/9780429161612-15
Autor:
Charles J. Colbourn
Publikováno v:
Graphs and Combinatorics. 37:1405-1413
For a consecutive ordering of the edges of a graph $$G=(V,E)$$ , the point sum of a vertex is the sum of the indices of edges incident with that vertex. Motivated by questions of balancing accesses in data placements in the presence of popularity ran
Publikováno v:
Networks. 77:146-160