Fast reliability ranking of matchstick minimal networks (Q6065903): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: SOME CONJECTURED UNIFORMLY OPTIMAL RELIABLE NETWORKS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Network Reliability Analysis: An Overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniformly most reliable two‐terminal graphs / 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: Nonexistence of optimal graphs for all terminal reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average reliability of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theorem for partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with randomly deleted edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliable circuits using less reliable relays / 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: A Linear-Time Algorithm for Computing <i>K</i>-Terminal Reliability in Series-Parallel Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some applications of algebra to combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3225387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Conjecture of Andrica and Tomescu / rank
 
Normal rank
Property / cites work
 
Property / cites work: What is the probability of connecting two points? / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Boesch's conjecture / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:24, 21 August 2024

scientific article; zbMATH DE number 7775558
Language Label Description Also known as
English
Fast reliability ranking of matchstick minimal networks
scientific article; zbMATH DE number 7775558

    Statements

    Fast reliability ranking of matchstick minimal networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    11 December 2023
    0 references
    0 references
    heaviside most reliable
    0 references
    minimal two-terminal network
    0 references
    poset of compositions
    0 references
    reliability polynomial
    0 references
    uniformly most reliable
    0 references