Speeding up computation of the reliability polynomial coefficients for a random graph (Q650005): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1134/s0005117911070150 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979348013 / rank
 
Normal rank

Latest revision as of 11:00, 30 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
    0 references

    Identifiers