Brown, Jason I.; Colbourn, Charles J.; Cox, Danielle; Graves, Christina; Mol, Lucas Network reliability: heading out on the highway. (English) Zbl 1528.90087 Networks 77, No. 1, 146-160 (2021). MSC: 90B25 90B10 PDFBibTeX XMLCite \textit{J. I. Brown} et al., Networks 77, No. 1, 146--160 (2021; Zbl 1528.90087) Full Text: DOI
Colbourn, Charles J.; Quattrocchi, Gaetano; Syrotiuk, Violet R. Grooming for two-period optical networks. (English) Zbl 1160.68309 Networks 52, No. 4, 307-324 (2008). MSC: 68M10 PDFBibTeX XMLCite \textit{C. J. Colbourn} et al., Networks 52, No. 4, 307--324 (2008; Zbl 1160.68309) Full Text: DOI
Colbourn, Charles J.; Quattrocchi, Gaetano; Syrotiuk, Violet R. Lower bounds for two-period grooming via linear programming duality. (English) Zbl 1159.90325 Networks 52, No. 4, 299-306 (2008). MSC: 90B15 90C05 90C10 PDFBibTeX XMLCite \textit{C. J. Colbourn} et al., Networks 52, No. 4, 299--306 (2008; Zbl 1159.90325) Full Text: DOI
Farley, Toni R.; Colbourn, Charles J. Multiterminal resilience for series-parallel networks. (English) Zbl 1125.68013 Networks 50, No. 2, 164-172 (2007). MSC: 68M15 PDFBibTeX XMLCite \textit{T. R. Farley} and \textit{C. J. Colbourn}, Networks 50, No. 2, 164--172 (2007; Zbl 1125.68013) Full Text: DOI
Colbourn, Charles J.; Wan, Peng-Jun Minimizing drop cost for SONET/WDM networks with \(\frac 18\) wavelength requirements. (English) Zbl 0967.90010 Networks 37, No. 2, 107-116 (2001). MSC: 90B10 05C35 PDFBibTeX XMLCite \textit{C. J. Colbourn} and \textit{P.-J. Wan}, Networks 37, No. 2, 107--116 (2001; Zbl 0967.90010) Full Text: DOI
Colbourn, Charles J. (ed.); Sutner, Klaus (ed.) Computing network reliability and performability. (English) Zbl 0819.00010 Networks 25, No. 3, 99-175 (1995). MSC: 00B15 90-06 PDFBibTeX XMLCite \textit{C. J. Colbourn} (ed.) and \textit{K. Sutner} (ed.), Networks 25, No. 3, 99--175 (1995; Zbl 0819.00010) Full Text: DOI
Strayer, Heidi J.; Colbourn, Charles J. Consecutive cuts and paths, and bounds on \(k\)-terminal reliability. (English) Zbl 0829.90059 Networks 25, No. 3, 165-175 (1995). MSC: 90B15 90B25 PDFBibTeX XMLCite \textit{H. J. Strayer} and \textit{C. J. Colbourn}, Networks 25, No. 3, 165--175 (1995; Zbl 0829.90059) Full Text: DOI
Harms, Daryl D.; Colbourn, Charles J. Renormalization of two-terminal reliability. (English) Zbl 0774.90030 Networks 23, No. 4, 289-297 (1993). MSC: 90B18 90B25 PDFBibTeX XMLCite \textit{D. D. Harms} and \textit{C. J. Colbourn}, Networks 23, No. 4, 289--297 (1993; Zbl 0774.90030) Full Text: DOI
Brown, Jason I.; Colbourn, Charles J.; Devitt, John S. Network transformations and bounding network reliability. (English) Zbl 0780.90046 Networks 23, No. 1, 1-17 (1993). MSC: 90B18 90B25 PDFBibTeX XMLCite \textit{J. I. Brown} et al., Networks 23, No. 1, 1--17 (1993; Zbl 0780.90046) Full Text: DOI
Elmallah, Ehab S.; Colbourn, Charles J. Series-parallel subgraphs of planar graphs. (English) Zbl 0766.05051 Networks 22, No. 6, 607-614 (1992). Reviewer: M.Knor (Bratislava) MSC: 05C40 05C10 PDFBibTeX XMLCite \textit{E. S. Elmallah} and \textit{C. J. Colbourn}, Networks 22, No. 6, 607--614 (1992; Zbl 0766.05051) Full Text: DOI
AboElFotoh, Hosam M.; Colbourn, Charles J. Efficient algorithms for computing the reliability of permutation and interval graphs. (English) Zbl 0722.90028 Networks 20, No. 7, 883-898 (1990). Reviewer: A.Pasculescu (Bucureşti) MSC: 90B25 90B18 68R10 90-08 68Q25 90C60 PDFBibTeX XMLCite \textit{H. M. AboElFotoh} and \textit{C. J. Colbourn}, Networks 20, No. 7, 883--898 (1990; Zbl 0722.90028) Full Text: DOI
Nel, Louis D.; Colbourn, Charles J. Combining Monte Carlo estimates and bounds for network reliability. (English) Zbl 0699.90043 Networks 20, No. 3, 277-298 (1990). Reviewer: M.Bertrand MSC: 90B25 90B15 65C05 PDFBibTeX XMLCite \textit{L. D. Nel} and \textit{C. J. Colbourn}, Networks 20, No. 3, 277--298 (1990; Zbl 0699.90043) Full Text: DOI
Brecht, Timothy B.; Colbourn, Charles J. Multiplicative implovements in network reliability bounds. (English) Zbl 0671.90025 Networks 19, No. 5, 521-529 (1989). MSC: 90B25 90B10 90B15 PDFBibTeX XMLCite \textit{T. B. Brecht} and \textit{C. J. Colbourn}, Networks 19, No. 5, 521--529 (1989; Zbl 0671.90025) Full Text: DOI
Brecht, Timothy B.; Colbourn, Charles J. Improving reliability bounds in computer networks. (English) Zbl 0644.90044 Networks 16, No. 4, 369-380 (1986). MSC: 90B25 90B10 PDFBibTeX XMLCite \textit{T. B. Brecht} and \textit{C. J. Colbourn}, Networks 16, No. 4, 369--380 (1986; Zbl 0644.90044) Full Text: DOI
Neufeld, Eric M.; Colbourn, Charles J. The most reliable series-parallel networks. (English) Zbl 0586.90045 Networks 15, 27-32 (1985). MSC: 90B25 90B10 PDFBibTeX XMLCite \textit{E. M. Neufeld} and \textit{C. J. Colbourn}, Networks 15, 27--32 (1985; Zbl 0586.90045) Full Text: DOI
Wald, Joseph A.; Colbourn, Charles J. Steiner trees, partial 2-trees, and minimum IFI networks. (English) Zbl 0529.68036 Networks 13, 159-167 (1983). MSC: 68R10 05C05 94C15 68Q25 PDFBibTeX XMLCite \textit{J. A. Wald} and \textit{C. J. Colbourn}, Networks 13, 159--167 (1983; Zbl 0529.68036) Full Text: DOI
Colbourn, Charles J. On testing isomorphism of permutation graphs. (English) Zbl 0459.68031 Networks 11, 13-21 (1981). MSC: 68R10 06A06 PDFBibTeX XMLCite \textit{C. J. Colbourn}, Networks 11, 13--21 (1981; Zbl 0459.68031) Full Text: DOI