Computational complexity of network vulnerability analysis (Q6160687): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4641786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robustness of Regular Caterpillars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network robustness and residual closeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge‐tenacious networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3789603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing tough graphs is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity and edge-disjoint spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring the vulnerability for classes of intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097134 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on the Link Residual Closeness of Graphs Under Join Operation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tenacity and rupture degree of permutation graphs of complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a class of posets and the corresponding comparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871072 / 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: Q3032280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complex networks: structure and dynamics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Scattering Number of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5065798 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2804772 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5355027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closeness centrality in some splitting networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tough graphs and Hamiltonian circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rupture degree of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Link Vulnerability in Networks / rank
 
Normal rank

Latest revision as of 11:21, 1 August 2024

scientific article; zbMATH DE number 7701160
Language Label Description Also known as
English
Computational complexity of network vulnerability analysis
scientific article; zbMATH DE number 7701160

    Statements

    Computational complexity of network vulnerability analysis (English)
    0 references
    26 June 2023
    0 references
    vulnerability
    0 references
    complex networks
    0 references
    design of algorithms
    0 references
    graph algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references