Skip to search formSkip to main contentSkip to account menu

Charles Colbourn

Known as: Colbourn 
Charles Joseph Colbourn (born October 24, 1953) is a Canadian computer scientist and mathematician, whose research concerns graph algorithms… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
We present a new algorithm for generating a uniformly random spanning tree in an undirected graph. Our algorithm samples such a… 
Highly Cited
2012
Highly Cited
2012
Combinatorial interaction testing (CIT) is a testing technique that requires covering all t‐sized tuples of values out of n… 
2011
2011
The notion of a detecting array (DTA) was proposed, recently, by Colbourn and McClary in their research on software interaction… 
Highly Cited
2008
Highly Cited
2008
This paper presents two strategies for multi‐way testing (i.e. t‐way testing with t>2). The first strategy generalizes an… 
2006
2006
We show that evaluating the Tutte polynomial for the class of bicircular matroids is #P-hard at every point $(x,y)$ except those… 
Highly Cited
2005
Highly Cited
2005
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… 
Review
1984
Review
1984
SummaryRecent denitrification research is reviewed to answer questions a) how much N is lost from the soil as N2 and N2O and b…