The average reliability of a graph (Q406318): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5558293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of uniformly optimally reliable networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chip firing and all-terminal network reliability bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniformly-most reliable networks do not always exist / rank
 
Normal rank
Property / cites work
 
Property / cites work: Taking Limits under the Integral Sign / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniformly optimally reliable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5819609 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reliability-improving graph transformation with applications to network reliability / rank
 
Normal rank

Latest revision as of 00:08, 9 July 2024

scientific article
Language Label Description Also known as
English
The average reliability of a graph
scientific article

    Statements

    The average reliability of a graph (English)
    0 references
    0 references
    0 references
    0 references
    8 September 2014
    0 references
    all-terminal reliability
    0 references
    average reliability
    0 references
    closure
    0 references
    optimal graph
    0 references
    cycle bundles
    0 references

    Identifiers