Measuring the robustness of a network using minimal vertex covers (Q2229891): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q60246096, #quickstatements; #temporary_batch_1710970253704
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Emergence of Scaling in Random Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Commutative Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure and Function of Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4528984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective dynamics of ‘small-world’ networks / rank
 
Normal rank

Revision as of 14:53, 24 July 2024

scientific article
Language Label Description Also known as
English
Measuring the robustness of a network using minimal vertex covers
scientific article

    Statements

    Measuring the robustness of a network using minimal vertex covers (English)
    0 references
    0 references
    18 February 2021
    0 references
    network robustness
    0 references
    covering degree
    0 references
    covering index
    0 references
    minimal vertex covers
    0 references

    Identifiers