21 results on '"Colbourn, Charles J."'
Search Results
2. Network reliability: Heading out on the highway.
3. Lower bounds for two-period grooming via linear programming duality
4. Grooming for two‐period optical networks
5. Multiterminal resilience for series-parallel networks
6. Minimizing drop cost for SONET/WDM networks with ? wavelength requirements
7. Preface
8. Consecutive cuts and paths, and bounds onk‐terminal reliability
9. Renormalization of two—terminal reliability
10. Network transformations and bounding network reliability
11. Series-parallel subgraphs of planar graphs
12. Efficient algorithms for computing the reliability of permutation and interval graphs
13. Combining monte carlo estimates and bounds for network reliability
14. Minimizing drop cost for SONET/WDM networks with ⅛ wavelength requirements.
15. Consecutive cuts and paths, and bounds on k-terminal reliability.
16. Multiplicative improvements in network reliability bounds.
17. Bounding all-terminal reliability in computer networks.
18. Improving reliability bounds in computer networks.
19. The most reliable series-parallel networks.
20. Steiner trees, partial 2-trees, and minimum IFI networks.
21. On testing isomorphism of permutation graphs.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.