On the characterization of the domination of a diameter-constrained network reliability model (Q2500537): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2006.03.029 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2079195483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Network Reliability and Domination Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Coherent Systems and the Reliability Polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting trees to meet biconnectivity and diameter constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination theory and the crapo β-invariant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the weight of shallow Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / 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: A Unified Formula for Analysis of Some Network Reliability Problems / 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: Q4017178 / rank
 
Normal rank

Latest revision as of 18:21, 24 June 2024

scientific article
Language Label Description Also known as
English
On the characterization of the domination of a diameter-constrained network reliability model
scientific article

    Statements

    On the characterization of the domination of a diameter-constrained network reliability model (English)
    0 references
    0 references
    0 references
    17 August 2006
    0 references
    graph theory
    0 references
    domination
    0 references
    diameter
    0 references
    network reliability
    0 references

    Identifiers