Counting almost minimum cutsets with reliability applications (Q3768663): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Network Reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of network reliability computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculating bounds on reachability and connectedness in stochastic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the Reliability Polynomial for Shellable Independence Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n‐Bonds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on two-terminal network reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dissection of rectangles into squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recursive algorithm for finding reliability measures related to the connection of nodes in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3718464 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101857 / 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: Q3030848 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Reliability of Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks / 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: Network reliability analysis: Part I / rank
 
Normal rank

Latest revision as of 12:25, 18 June 2024

scientific article
Language Label Description Also known as
English
Counting almost minimum cutsets with reliability applications
scientific article

    Statements

    Counting almost minimum cutsets with reliability applications (English)
    0 references
    0 references
    0 references
    1987
    0 references
    probabilistic graph
    0 references
    network reliability
    0 references
    inclusion-exclusion
    0 references
    network cutsets in a graph
    0 references
    minimum cardinality network cutsets
    0 references
    polynomial time algorithm
    0 references
    edge-weighted graph
    0 references
    reliability bounds
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references