Skip to main navigation
Skip to search
Skip to main content
Arizona State University Home
Home
Profiles
Departments and Centers
Scholarly Works
Activities
Equipment
Grants
Datasets
Prizes
Search by expertise, name or affiliation
A note on bounding k-terminal reliability
Charles J. Colbourn
Research output
:
Contribution to journal
›
Article
›
peer-review
1
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'A note on bounding k-terminal reliability'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Steiner Tree
100%
Upper bound
51%
Generalization
40%
Graph in graph theory
36%
Theorem
31%