default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCharles J. Colbourn
Charles Joseph Colbourn
Person information
- affiliation: Arizona State University, Tempe, School of Computing, Informatics and Decision Systems Engineering
- affiliation: University of Waterloo, Department of Computer Science, University of Waterloo
- award (2003): Euler Medal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j249]Charles J. Colbourn, Colin Ingalls, Jonathan Jedwab, Mark Saaltink, Ken W. Smith, Brett Stevens:
Sets of mutually orthogoval projective and affine planes. Comb. Theory 4(1) (2024)- [j248]Charles J. Colbourn, Violet R. Syrotiuk:
Detecting arrays for effects of multiple interacting factors. Inf. Comput. 301: 105202 (2024) - [j247]Erin Lanus
, Charles J. Colbourn, Gail-Joon Ahn:
Guaranteeing anonymity in attribute-based authorization. J. Inf. Secur. Appl. 87: 103895 (2024) - [j246]Charles J. Colbourn:
Efficient Greedy Algorithms with Accuracy Guarantees for Combinatorial Restrictions. SN Comput. Sci. 5(2): 247 (2024) - 2023
- [j245]Dylan Lusi, Charles J. Colbourn:
The spectrum of resolvable Bose triple systems. Discret. Math. 346(7): 113396 (2023) - [j244]Ryan E. Dougherty, Kristoffer Kleine, Michael Wagner, Charles J. Colbourn, Dimitris E. Simos:
Algorithmic methods for covering arrays of higher index. J. Comb. Optim. 45(1): 28 (2023) - [c61]Michael Wagner, Charles J. Colbourn, Dimitris E. Simos:
Summary of In-Parameter-Order strategies for covering perfect hash families. ICSTW 2023: 268-270 - [i15]Erin Lanus, Charles J. Colbourn, Gail-Joon Ahn:
Guaranteeing Anonymity in Attribute-Based Authorization. CoRR abs/2310.04896 (2023) - 2022
- [j243]Michael Wagner, Charles J. Colbourn, Dimitris E. Simos:
In-Parameter-Order strategies for covering perfect hash families. Appl. Math. Comput. 421: 126952 (2022) - [j242]Charles J. Colbourn:
Egalitarian Steiner quadruple systems of doubly even order. Discret. Math. 345(7): 112887 (2022) - [j241]Soumen Maity, Charles J. Colbourn:
Mixed covering arrays on graphs of small treewidth. Discret. Math. Algorithms Appl. 14(1): 2150085:1-2150085:15 (2022) - [c60]Chao Pan, Ryan Gabrys, Xujun Liu, Charles J. Colbourn, Olgica Milenkovic:
Balanced and Swap-Robust Trades for Dynamical Distributed Storage. ISIT 2022: 2385-2390 - [i14]Chao Pan, Ryan Gabrys, Xujun Liu, Charles J. Colbourn, Olgica Milenkovic:
Balanced and Swap-Robust Trades for Dynamical Distributed Storage. CoRR abs/2201.09171 (2022) - [i13]Charles J. Colbourn, Colin Ingalls, Jonathan Jedwab, Mark Saaltink, Ken W. Smith, Brett Stevens:
Sets of mutually orthogoval projective and affine planes. CoRR abs/2210.11961 (2022) - 2021
- [j240]Charles J. Colbourn:
Egalitarian Steiner triple systems for data popularity. Des. Codes Cryptogr. 89(10): 2373-2395 (2021) - [j239]Charles J. Colbourn:
Egalitarian Edge Orderings of Complete Graphs. Graphs Comb. 37(4): 1405-1413 (2021) - [j238]Jason I. Brown, Charles J. Colbourn, Danielle Cox, Christina Graves, Lucas Mol:
Network reliability: Heading out on the highway. Networks 77(1): 146-160 (2021) - 2020
- [j237]Yeow Meng Chee, Charles J. Colbourn, Hoang Dau, Ryan Gabrys, Alan C. H. Ling, Dylan Lusi, Olgica Milenkovic:
Access balancing in storage systems by labeling partial Steiner systems. Des. Codes Cryptogr. 88(11): 2361-2376 (2020) - [j236]Yanxun Chang, Charles J. Colbourn, Adam Gowty, Daniel Horsley, Junling Zhou:
New bounds on the maximum size of Sperner partition systems. Eur. J. Comb. 90: 103165 (2020) - [j235]Nadia Pisanti, Charles J. Colbourn, Roberto Grossi:
Editorial: Special Issue on International Workshop on Combinatorial Algorithms (IWOCA 2019). Theory Comput. Syst. 64(7): 1155-1157 (2020) - [j234]Ryan Gabrys, Son Hoang Dau, Charles J. Colbourn, Olgica Milenkovic:
Set-Codes with Small Intersections and Small Discrepancies. SIAM J. Discret. Math. 34(2): 1148-1171 (2020) - [c59]Charles J. Colbourn:
Popularity Block Labelling for Steiner Systems. ACCT 2020: 41-46 - [c58]Yeow Meng Chee, Charles Joseph Colbourn, Hoang Dau, Ryan Gabrys, Alan Chi Hung Ling, Dylan Lusi, Olgica Milenkovic:
Access Balancing in Storage Systems by Labeling Partial Steiner Systems. ISIT 2020: 566-570 - [c57]Erin Lanus, Charles J. Colbourn:
Algorithms for Constructing Anonymizing Arrays. IWOCA 2020: 382-394
2010 – 2019
- 2019
- [j233]Matthew J. Mellott, Domenico Garlisi, Charles J. Colbourn, Violet R. Syrotiuk, Ilenia Tinnirello:
Realizing airtime allocations in multi-hop Wi-Fi networks: A stability and convergence study with testbed evaluation. Comput. Commun. 145: 273-283 (2019) - [j232]Charles J. Colbourn, Douglas R. Stinson, Shannon Veitch:
Constructions of optimal orthogonal arrays with repeated rows. Discret. Math. 342(9): 2455-2466 (2019) - [j231]Charles J. Colbourn, Ryan E. Dougherty, Daniel Horsley:
Distributing hash families with few rows. Theor. Comput. Sci. 800: 31-41 (2019) - [c56]Charles J. Colbourn, Violet R. Syrotiuk:
Detecting Arrays for Main Effects. CAI 2019: 112-123 - [c55]Ryan E. Dougherty, Erin Lanus, Charles J. Colbourn, Stephanie Forrest:
Genetic algorithms for affine transformations to existential t-restrictions. GECCO (Companion) 2019: 1707-1708 - [c54]Erin Lanus, Charles J. Colbourn, Douglas C. Montgomery:
Partitioned Search with Column Resampling for Locating Array Construction. ICST Workshops 2019: 214-223 - [c53]Ryan Gabrys, Hoang Dau, Charles J. Colbourn, Olgica Milenkovic:
Set-Codes with Small Intersections and Small Discrepancies. ISIT 2019: 2359-2363 - [c52]Stephen A. Seidel, Charles J. Colbourn, Violet R. Syrotiuk:
Robustness of Recovery in Locating Array-Based Screening Experiments. SpringSim 2019: 1-12 - [e1]Charles J. Colbourn, Roberto Grossi, Nadia Pisanti:
Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23-25, 2019, Proceedings. Lecture Notes in Computer Science 11638, Springer 2019, ISBN 978-3-030-25004-1 [contents] - [i12]Ryan Gabrys, Son Hoang Dau, Charles J. Colbourn, Olgica Milenkovic:
Set-Codes with Small Intersections and Small Discrepancies. CoRR abs/1901.05559 (2019) - [i11]Yeow Meng Chee, Charles J. Colbourn, Hoang Dau, Ryan Gabrys, Alan C. H. Ling, Dylan Lusi, Olgica Milenkovic:
Access Balancing in Storage Systems by Labeling Partial Steiner Systems. CoRR abs/1906.12073 (2019) - 2018
- [j230]Charles J. Colbourn, Erin Lanus:
Subspace restrictions and affine composition for covering perfect hash families. Art Discret. Appl. Math. 1(2): #P2.03 (2018) - [j229]Charles J. Colbourn, Daniel Horsley, Violet R. Syrotiuk:
A hierarchical framework for recovery in compressive sensing. Discret. Appl. Math. 236: 96-107 (2018) - [j228]Charles J. Colbourn, Erin Lanus, Kaushik Sarkar:
Asymptotic and constructive methods for covering perfect hash families and covering arrays. Des. Codes Cryptogr. 86(4): 907-937 (2018) - [j227]Charles J. Colbourn, Ryan E. Dougherty:
Fractal Perfect Hash Families (Extended Abstract). Electron. Notes Discret. Math. 65: 37-42 (2018) - [j226]Soumen Maity, Yasmeen Akhtar, Reshma C. Chandrasekharan, Charles J. Colbourn:
Improved Strength Four Covering Arrays with Three Symbols. Graphs Comb. 34(1): 223-239 (2018) - [j225]Charles J. Colbourn, Violet R. Syrotiuk:
On a Combinatorial Framework for Fault Characterization. Math. Comput. Sci. 12(4): 429-451 (2018) - [j224]Kaushik Sarkar, Charles J. Colbourn, Annalisa De Bonis, Ugo Vaccaro:
Partial Covering Arrays: Algorithms and Asymptotics. Theory Comput. Syst. 62(6): 1470-1489 (2018) - [j223]Guanqiu Qi, Wei-Tek Tsai, Charles J. Colbourn, Jie Luo, Zhiqin Zhu:
Test-Algebra-Based Fault Location Analysis for the Concurrent Combinatorial Testing. IEEE Trans. Reliab. 67(3): 802-831 (2018) - [c51]Charles J. Colbourn, Ryan E. Dougherty, Thomas Finn Lidbetter, Jeffrey O. Shallit:
Counting Subwords and Regular Languages. DLT 2018: 231-242 - [c50]Stephen A. Seidel, Michael T. Mehari, Charles J. Colbourn, Eli De Poorter, Ingrid Moerman, Violet R. Syrotiuk:
Analysis of large-scale experimental data from wireless networks. INFOCOM Workshops 2018: 535-540 - [c49]Stephen A. Seidel, Kaushik Sarkar, Charles J. Colbourn, Violet R. Syrotiuk:
Separating Interaction Effects Using Locating and Detecting Arrays. IWOCA 2018: 349-360 - [c48]Matthew J. Mellott, Charles J. Colbourn, Violet R. Syrotiuk, Ilenia Tinnirello:
Testbed Evaluation of Optimized REACT over Multi-hop Paths. WWIC 2018: 134-145 - [i10]Charles J. Colbourn, Ryan E. Dougherty, Thomas Finn Lidbetter, Jeffrey O. Shallit:
Counting Subwords and Regular Languages. CoRR abs/1804.11175 (2018) - 2017
- [j222]Jonathan Lutz, Charles J. Colbourn, Violet R. Syrotiuk:
Variable-weight topology-transparent scheduling. Comput. Networks 122: 16-28 (2017) - [j221]Kaushik Sarkar, Charles J. Colbourn:
Upper Bounds on the Size of Covering Arrays. SIAM J. Discret. Math. 31(2): 1277-1293 (2017) - [j220]Darryn E. Bryant, Charles J. Colbourn, Daniel Horsley, Ian M. Wanless:
Steiner Triple Systems with High Chromatic Index. SIAM J. Discret. Math. 31(4): 2603-2611 (2017) - [j219]Darryn E. Bryant, Charles J. Colbourn, Daniel Horsley, Padraig Ó Catháin:
Compressed Sensing With Combinatorial Designs: Theory and Simulations. IEEE Trans. Inf. Theory 63(8): 4850-4859 (2017) - 2016
- [j218]Charles J. Colbourn, Bingli Fan, Daniel Horsley:
Disjoint Spread Systems and Fault Location. SIAM J. Discret. Math. 30(4): 2011-2026 (2016) - [c47]Charles J. Colbourn, Violet R. Syrotiuk:
Coverage, Location, Detection, and Measurement. ICST Workshops 2016: 19-25 - [c46]Randy Compton, Michael T. Mehari, Charles J. Colbourn, Eli De Poorter, Violet R. Syrotiuk:
Screening interacting factors in a wireless network testbed using locating arrays. INFOCOM Workshops 2016: 650-655 - [c45]Kaushik Sarkar, Charles J. Colbourn, Annalisa De Bonis, Ugo Vaccaro:
Partial Covering Arrays: Algorithms and Asymptotics. IWOCA 2016: 437-448 - [i9]Kaushik Sarkar, Charles J. Colbourn, Annalisa De Bonis, Ugo Vaccaro:
Partial Covering Arrays: Algorithms and Asymptotics. CoRR abs/1605.02131 (2016) - [i8]Kaushik Sarkar, Charles J. Colbourn:
Two-stage algorithms for covering array construction. CoRR abs/1606.06730 (2016) - 2015
- [j217]Charles J. Colbourn, Maria De Lourdes Merlini Giuliani, Alexander Rosa, Izabella Stuhl:
Steiner loops satisfying Moufang's theorem. Australas. J Comb. 63: 170-181 (2015) - [j216]Yeow Meng Chee, Charles J. Colbourn, Alan Chi Hung Ling, Hui Zhang, Xiande Zhang:
Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses. Des. Codes Cryptogr. 77(2-3): 479-491 (2015) - [j215]Charles J. Colbourn:
Augmentation of Covering Arrays of Strength Two. Graphs Comb. 31(6): 2137-2147 (2015) - [j214]Changhai Nie, Huayao Wu, Xintao Niu, Fei-Ching Kuo, Hareton K. N. Leung, Charles J. Colbourn:
Combinatorial testing, random testing, and adaptive random testing for detecting interaction triggered failures. Inf. Softw. Technol. 62: 198-213 (2015) - [j213]Shi-Wei Gao, Jianghua Lv, Bing-Lei Du, Charles J. Colbourn, Shilong Ma:
Balancing Frequencies and Fault Detection in the In-Parameter-Order Algorithm. J. Comput. Sci. Technol. 30(5): 957-968 (2015) - [j212]Abraham N. Aldaco, Charles J. Colbourn, Violet R. Syrotiuk:
Locating Arrays: A New Experimental Design for Screening Complex Engineered Systems. ACM SIGOPS Oper. Syst. Rev. 49(1): 31-40 (2015) - [j211]Huayao Wu, Changhai Nie, Fei-Ching Kuo, Hareton K. N. Leung, Charles J. Colbourn:
A Discrete Particle Swarm Optimization for Covering Array Generation. IEEE Trans. Evol. Comput. 19(4): 575-591 (2015) - [i7]Darryn E. Bryant, Charles J. Colbourn, Daniel Horsley, Padraig Ó Catháin:
Compressed sensing and designs: theory and simulations. CoRR abs/1503.07424 (2015) - [i6]Yuichiro Fujiwara, Charles J. Colbourn:
A combinatorial approach to X-tolerant compaction circuits. CoRR abs/1508.00481 (2015) - 2014
- [j210]Charles J. Colbourn, Melissa S. Keranen, Donald L. Kreher:
f-vectors of pure complexes and pure multicomplexes of rank three. Discret. Math. 320: 26-39 (2014) - [j209]Charles J. Colbourn:
Covering arrays, augmentation, and quilting arrays. Discret. Math. Algorithms Appl. 6(3) (2014) - [j208]Jonathan Lutz, Charles J. Colbourn, Violet R. Syrotiuk:
ATLAS: Adaptive Topology- andLoad-Aware Scheduling. IEEE Trans. Mob. Comput. 13(10): 2255-2268 (2014) - [c44]Patrick C. Murray, Charles J. Colbourn:
Sequence Covering Arrays and Linear Extensions. IWOCA 2014: 274-285 - [i5]Charles J. Colbourn, Daniel Horsley, Violet R. Syrotiuk:
Hierarchical Recovery in Compressive Sensing. CoRR abs/1403.1835 (2014) - 2013
- [j207]Peyman Nayeri, Charles J. Colbourn, Goran Konjevod:
Randomized post-optimization of covering arrays. Eur. J. Comb. 34(1): 91-103 (2013) - [j206]Chengmin Wang, Charles J. Colbourn:
The Existence of (K 2 × K 6)-Designs. Graphs Comb. 29(5): 1557-1567 (2013) - [j205]Toni R. Farley, Jeff Kiefer, Preston Lee, Daniel Von Hoff, Jeffrey M. Trent, Charles J. Colbourn, Spyro Mousses:
The BioIntelligence Framework: a new computational platform for biomedical knowledge computing. J. Am. Medical Informatics Assoc. 20(1): 128-133 (2013) - [j204]Yeow Meng Chee, Charles J. Colbourn, Alan C. H. Ling, Richard M. Wilson:
Covering and packing for pairs. J. Comb. Theory A 120(7): 1440-1449 (2013) - [j203]Yeow Meng Chee, Charles J. Colbourn, Daniel Horsley, Junling Zhou:
Sequence Covering Arrays. SIAM J. Discret. Math. 27(4): 1844-1861 (2013) - [j202]Jonathan Lutz, Charles J. Colbourn, Violet R. Syrotiuk:
Topological Persistence for Medium Access Control. IEEE Trans. Mob. Comput. 12(8): 1598-1612 (2013) - [c43]Charles J. Colbourn, Peyman Nayeri:
Randomized Post-optimization for t-Restrictions. Information Theory, Combinatorics, and Search Theory 2013: 597-608 - [c42]Wei-Tek Tsai, Qingyang Li, Charles J. Colbourn, Xiaoying Bai:
Adaptive Fault Detection for Testing Tenant Applications in Multi-tenancy SaaS Systems. IC2E 2013: 183-192 - [c41]Wei-Tek Tsai, Charles J. Colbourn, Jie Luo, Guanqiu Qi, Qingyang Li, Xiaoying Bai:
Test algebra for combinatorial testing. AST 2013: 19-25 - [c40]Changhai Nie, Jing Jiang, Huayao Wu, Hareton Leung, Charles J. Colbourn:
Empirically Identifying the Best Greedy Algorithm for Covering Array Generation. ICST Workshops 2013: 239-248 - [p5]Charles J. Colbourn, Jeffrey H. Dinitz:
Block designs. Handbook of Finite Fields 2013: 589-598 - [p4]Jeffrey H. Dinitz, Charles J. Colbourn:
Other combinatorial structures. Handbook of Finite Fields 2013: 607-618 - [i4]Jonathan Lutz, Charles J. Colbourn, Violet R. Syrotiuk:
ATLAS: Adaptive Topology- and Load-Aware Scheduling. CoRR abs/1305.4897 (2013) - 2012
- [j201]Charles J. Colbourn, Daniel Horsley, Chengmin Wang:
Trails of triples in partial triple systems. Des. Codes Cryptogr. 65(3): 199-212 (2012) - [j200]Charles J. Colbourn, Alan C. H. Ling, Gaetano Quattrocchi, Violet R. Syrotiuk:
Grooming traffic to minimize load. Discret. Math. 312(3): 536-544 (2012) - [j199]Jason R. Lobb, Charles J. Colbourn, Peter Danziger, Brett Stevens, Jose Torres-Jimenez:
Cover starters for covering arrays of strength two. Discret. Math. 312(5): 943-956 (2012) - [j198]Charles J. Colbourn, Daniel Horsley, Violet R. Syrotiuk:
Strengthening hash families and compressive sensing. J. Discrete Algorithms 16: 170-186 (2012) - [c39]Jonathan Lutz, Charles J. Colbourn, Violet R. Syrotiuk:
Variable Weight Sequences for Adaptive Scheduled Access in MANETs. SETA 2012: 53-64 - 2011
- [j197]Charles J. Colbourn, Gennian Ge, Alan C. H. Ling:
Optical grooming with grooming ratio nine. Discret. Math. 311(1): 8-15 (2011) - [j196]Charles J. Colbourn, Petteri Kaski, Patric R. J. Östergård, David A. Pike, Olli Pottonen:
Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19. Discret. Math. 311(10-11): 827-834 (2011) - [j195]Charles J. Colbourn, Gaetano Quattrocchi, Violet R. Syrotiuk:
Grooming Traffic to Maximize Throughput in SONET Rings. JOCN 3(1): 10-16 (2011) - [j194]Charles J. Colbourn, Daniel Horsley, Christopher McLean:
Compressive Sensing Matrices and Hash Families. IEEE Trans. Commun. 59(7): 1840-1845 (2011) - [c38]Renée C. Bryce, Charles J. Colbourn, D. Richard Kuhn:
Finding Interaction Faults Adaptively Using Distance-Based Strategies. ECBS 2011: 4-13 - [c37]Charles J. Colbourn:
Efficient Conditional Expectation Algorithms for Constructing Hash Families. IWOCA 2011: 144-155 - [p3]Charles J. Colbourn:
Covering arrays and hash families. Information Security, Coding Theory and Related Combinatorics 2011: 99-135 - 2010
- [j193]Charles J. Colbourn, Anthony D. Forbes, Mike J. Grannell, Terry S. Griggs, Petteri Kaski, Patric R. J. Östergård, David A. Pike, Olli Pottonen:
Properties of the Steiner Triple Systems of Order 19. Electron. J. Comb. 17(1) (2010) - [j192]Charles J. Colbourn, Gerzson Kéri, P. P. Rivas Soriano, Jan-Christoph Schlage-Puchta:
Covering and radius-covering arrays: Constructions and classification. Discret. Appl. Math. 158(11): 1158-1180 (2010) - [j191]Charles J. Colbourn:
Covering arrays from cyclotomy. Des. Codes Cryptogr. 55(2-3): 201-219 (2010) - [j190]Jean-Claude Bermond, Charles J. Colbourn, Lucia Gionfriddo, Gaetano Quattrocchi, Ignasi Sau:
Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4. SIAM J. Discret. Math. 24(2): 400-419 (2010) - [j189]Yuichiro Fujiwara, Charles J. Colbourn:
A combinatorial approach to X-tolerant compaction circuits. IEEE Trans. Inf. Theory 56(7): 3196-3206 (2010) - [c36]Charles J. Colbourn, Daniel Horsley, Violet R. Syrotiuk:
Frameproof codes and compressive sensing. Allerton 2010: 985-990 - [c35]Jonathan Lutz, Charles J. Colbourn, Violet R. Syrotiuk:
Apples and oranges: comparing schedule- and contention-based medium access control. MSWiM 2010: 319-326 - [p2]Charles J. Colbourn, Yves Crama, Peter L. Hammer:
Boolean Aspects of Network Reliability. Boolean Models and Methods 2010: 723-759
2000 – 2009
- 2009
- [j188]Charles J. Colbourn, Yuichiro Fujiwara:
Small stopping sets in Steiner triple systems. Cryptogr. Commun. 1(1): 31-46 (2009) - [j187]Andreas H. Ronneseth, Charles J. Colbourn:
Merging covering arrays and compressing multiple sequence alignments. Discret. Appl. Math. 157(9): 2177-2190 (2009) - [j186]Charles J. Colbourn, Gennian Ge, Alan C. H. Ling:
Optical grooming with grooming ratio eight. Discret. Appl. Math. 157(13): 2763-2772 (2009) - [j185]Charles J. Colbourn, Alan C. H. Ling:
Linear hash families and forbidden configurations. Des. Codes Cryptogr. 52(1): 25-55 (2009) - [j184]Jason I. Brown, Charles J. Colbourn, Richard J. Nowakowski:
Chip firing and all-terminal network reliability bounds. Discret. Optim. 6(4): 436-445 (2009) - [j183]Alan C. H. Ling, Charles J. Colbourn, Gaetano Quattrocchi:
Minimum embedding of Steiner triple systems into (K4-e)-designs II. Discret. Math. 309(2): 400-411 (2009) - [j182]Charles J. Colbourn, Gennian Ge, Alan C. H. Ling:
Graph designs for the eight-edge five-vertex graphs. Discret. Math. 309(22): 6440-6445 (2009) - [j181]Toni R. Farley, Charles J. Colbourn:
Multi-Terminal Network Connectedness on Series-Parallel Networks. Discret. Math. Algorithms Appl. 1(2): 253-266 (2009) - [j180]Charles J. Colbourn, Alan C. H. Ling:
A recursive construction for perfect hash families. J. Math. Cryptol. 3(4): 291-306 (2009) - [j179]Renée C. Bryce, Charles J. Colbourn:
A density-based greedy algorithm for higher strength covering arrays. Softw. Test. Verification Reliab. 19(1): 37-53 (2009) - [c34]Charles J. Colbourn, Gerzson Kéri:
Binary Covering Arrays and Existentially Closed Graphs. IWCC 2009: 22-33 - [c33]Toni R. Farley, Charles J. Colbourn:
Multiterminal measures for network reliability and resilience. DRCN 2009: 107-114 - [c32]