Polynomial algorithms for estimating network reliability (Q3958250): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2001832122 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Paths, Trees, and Flowers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimum branchings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank |
Latest revision as of 16:54, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Polynomial algorithms for estimating network reliability |
scientific article |
Statements
Polynomial algorithms for estimating network reliability (English)
0 references
1982
0 references
limited information
0 references
polynomial algorithm
0 references
calculation of bounds
0 references
reliability bounds
0 references
estimation of network reliability
0 references
unreliable system components
0 references