Speeding up computation of the reliability polynomial coefficients for a random graph (Q650005): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Computational Science and Its Applications – ICCSA 2004 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Network reliability and the factoring theorem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4301917 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4248175 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computational Science and Its Applications – ICCSA 2004 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3907599 / rank | |||
Normal rank | |||
Revision as of 16:05, 4 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Speeding up computation of the reliability polynomial coefficients for a random graph |
scientific article |
Statements
Speeding up computation of the reliability polynomial coefficients for a random graph (English)
0 references
25 November 2011
0 references
random graph with reliable vertices and unreliable edges
0 references
