C
Charles J. Colbourn
Researcher at Arizona State University
Publications - 457
Citations - 15555
Charles J. Colbourn is an academic researcher from Arizona State University. The author has contributed to research in topics: Steiner system & Combinatorial design. The author has an hindex of 51, co-authored 450 publications receiving 14887 citations. Previous affiliations of Charles J. Colbourn include University of Saskatchewan & University of York.
Papers
More filters
BookDOI
CRC Handbook of Combinatorial Designs
TL;DR: Balanced Incomplete Block Designs and t-Designs2-(v,k,l) Designs of Small OrderBIBDs with Small Block Sizet-designs, t = 3Steiner SystemsSymmetric DesignsResolvable and Near Resolvable DesignsLatin Squares, MOLS, and Orthogonal ArraysLatin SquareMutually Orthogonomic Latin Squares (MOLS)Incomplete MOLsOrthogonal ARrays of Index More Than OneOrthoghonal Array of Strength More Than TwoPairwise Balanced Designs
Journal ArticleDOI
Unit disk graphs
Brent N. Clark,Brent N. Clark,Charles J. Colbourn,Charles J. Colbourn,David S. Johnson,David S. Johnson +5 more
TL;DR: It is shown that many standard graph theoretic problems remain NP-complete on unit disks, including coloring, independent set, domination, independent domination, and connected domination; NP-completeness for the domination problem is shown to hold even for grid graphs, a subclass of unit disk graphs.
Book
The Combinatorics of Network Reliability
TL;DR: The reliability polynominal Edge-disjoint subgraphs Additive and multiplicative improvements Combining the bounds The k-cycle bound Computational results References Index.
Book
Handbook of Combinatorial Designs
TL;DR: In this paper, the authors present a design theory of small-block designs of small order for the first time in the last half of the 20th century, starting from the design of the first block designs in the early 1950s.
Proceedings ArticleDOI
Constructing test suites for interaction testing
TL;DR: Initial results are presented suggesting that heuristic search techniques are more effective than some of the known greedy methods for finding smaller sized test suites for software interaction testing.