44 results on '"Colbourn, Charles J."'
Search Results
2. On the maximum double independence number of Steiner triple systems
3. Two‐stage algorithms for covering array construction
4. Group divisible covering designs with block size four
5. The Existence of Well‐Balanced Triple Systems
6. Computational Issues in Network Reliability
7. Doubly Resolvable Nearly Kirkman Triple Systems
8. Concepts of Network Reliability
9. A density-based greedy algorithm for higher strength covering arrays
10. Lower bounds for two-period grooming via linear programming duality
11. Grooming for two‐period optical networks
12. Computational Issues in Network Reliability
13. The density algorithm for pairwise interaction testing
14. Multiterminal resilience for series-parallel networks
15. Products of mixed covering arrays of strength two
16. Covering arrays of higher strength from permutation vectors
17. Recursive constructions for optimal (n,4,2)-OOCs
18. Concerning seven and eight mutually orthogonal Latin squares
19. Minimum embedding of P3‐designs into (K4—e)‐designs
20. Dominated error correcting codes with distance two
21. Minimizing drop cost for SONET/WDM networks with ? wavelength requirements
22. Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs
23. Steiner triple systems with disjoint or intersecting subsystems
24. Editorial
25. A Steiner 2-design with an automorphism fixing exactlyr + 2 points
26. The existence of uniform 5-GDDs
27. The spectrum for rotational Steiner triple systems
28. Preface
29. Consecutive cuts and paths, and bounds onk‐terminal reliability
30. Renormalization of two—terminal reliability
31. Editoral
32. Network transformations and bounding network reliability
33. Directed star decompositions of the complete directed graph
34. Series-parallel subgraphs of planar graphs
35. Efficient algorithms for computing the reliability of permutation and interval graphs
36. Combining monte carlo estimates and bounds for network reliability
37. Repeated edges in 2-factorizations
38. Orderly algorithms for generating restricted classes of graphs
39. The most reliable series-parallel networks
40. Improving reliability bounds in computer networks
41. On testing isomorphism of permutation graphs
42. Multiplicative improvements in network reliability bounds
43. Bounding all-terminal reliability in computer networks
44. Steiner trees, partial 2–trees, and minimum IFI networks
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.