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.
2016
2016
Given a graph G whose nodes are perfectly reliable and whose edges fail independently with probability q ∈ [0, 1], the all… 
2009
2009
A code design algorithm for application in multi-dimensional optical code division multiple access (MD-OCDMA) for asynchronous… 
2004
2004
Recently, there has been an upsurge of interest in using Code-Division Multiple-Access communication over optical fiber channels… 
2004
2004
With the proliferation of portable computing devices and ascending popularity of group-oriented computing, wireless ad hoc… 
2003
2003
Abstract.Specialized block-colourings of Steiner triple systems, in which the blocks incident at each point have a restricted… 
2002
2002
Based on the research of [Stil 1998] [Maurer 1992] [Lennon 1994] [Elliot 1995] [Colbourn 1995] [Reeves 1997] [Lugner 1997], the… 
Review
1997
Review
1997
Consider a system with N components which are subject to failures and repairs. Suppose that each component has a single operating… 
1989
1989
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…