Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,393,582 papers from all fields of science
Search
Sign In
Create Free Account
Charles Colbourn
Known as:
Colbourn
Charles Joseph Colbourn (born October 24, 1953) is a Canadian computer scientist and mathematician, whose research concerns graph algorithms…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
1 relation
Computer science
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Fast Generation of Random Spanning Trees and the Effective Resistance Metric
A. Madry
,
D. Straszak
,
Jakub Tarnawski
ACM-SIAM Symposium on Discrete Algorithms
2015
Corpus ID: 11660809
We present a new algorithm for generating a uniformly random spanning tree in an undirected graph. Our algorithm samples such a…
Expand
Highly Cited
2012
Highly Cited
2012
T‐wise combinatorial interaction test suites construction based on coverage inheritance
Andrea Calvagna
,
A. Gargantini
Software testing, verification & reliability
2012
Corpus ID: 15878007
Combinatorial interaction testing (CIT) is a testing technique that requires covering all t‐sized tuples of values out of n…
Expand
2011
2011
The equivalence between optimal detecting arrays and super-simple OAs
Ce Shi
,
Yu Tang
,
Jianxing Yin
Designs, Codes and Cryptography
2011
Corpus ID: 46688733
The notion of a detecting array (DTA) was proposed, recently, by Colbourn and McClary in their research on software interaction…
Expand
Highly Cited
2008
Highly Cited
2008
IPOG/IPOG‐D: efficient test generation for multi‐way combinatorial testing
Yu Lei
,
R. Kacker
,
D. Kuhn
,
Vadim Okun
,
James Lawrence
Software testing, verification & reliability
2008
Corpus ID: 2878511
This paper presents two strategies for multi‐way testing (i.e. t‐way testing with t>2). The first strategy generalizes an…
Expand
2008
2008
A few more Kirkman squares and doubly near resolvable BIBDs with block size 3
R. Abel
,
E. Lamken
,
Jinhua Wang
Discrete Mathematics
2008
Corpus ID: 36328977
2008
2008
Adaptive group testing for consecutive positives
J. Juan
,
G. Chang
Discrete Mathematics
2008
Corpus ID: 28186403
2006
2006
On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids
Omer Giménez
,
M. Noy
Combinatorics, probability & computing
2006
Corpus ID: 16936092
We show that evaluating the Tutte polynomial for the class of bicircular matroids is #P-hard at every point $(x,y)$ except those…
Expand
Highly Cited
2005
Highly Cited
2005
Group construction of covering arrays
Karen Meagher
,
B. Stevens
2005
Corpus ID: 10201592
A covering array t‐CA (n, k, g) is a k × n array on a set of g symbols with the property that in each t × n subarray, every t × 1…
Expand
2001
2001
Minimum weights of point codes of Steiner triple systems
C. Colbourn
2001
Corpus ID: 122157878
Review
1984
Review
1984
Denitrification in field soils
P. Colbourn
,
R. J. Dowdell
Plant and Soil
1984
Corpus ID: 34838182
SummaryRecent denitrification research is reviewed to answer questions a) how much N is lost from the soil as N2 and N2O and b…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE