Full complexity analysis of the diameter-constrained reliability (Q2806430): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Computational Complexity of Network Reliability Analysis: An Overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the 2‐diameter ‐constrained <i>K</i> ‐reliability of networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the 2-K-reliability in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliability of communication networks with delay constraints: computational complexity and complete topologies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-weight two-connected spanning networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4329144 / 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: Computing the Reliability of Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank

Latest revision as of 23:43, 11 July 2024

scientific article
Language Label Description Also known as
English
Full complexity analysis of the diameter-constrained reliability
scientific article

    Statements

    Identifiers