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
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.matcom.2014.04.001 / rank
Normal rank
 
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
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/mcs/Saenz-de-CabezonW14 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.MATCOM.2014.04.001 / rank
 
Normal rank

Latest revision as of 14:15, 17 December 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