Bound and exact methods for assessing link vulnerability in complex networks (Q405658): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting critical nodes in sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of determining the most vital elements for the \(p\)-median and \(p\)-center location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical edges/nodes for the minimum spanning tree problem: complexity and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying sets of key players in a social network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch and cut algorithms for detecting critical nodes in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for the Partitioning of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3286850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disconnecting graphs by removing vertices: a polyhedral approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the anti-block vital edge of a shortest path between two nodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A derandomized approximation algorithm for the critical node detection problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact identification of critical nodes in sparse networks via new compact formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective dynamics of ‘small-world’ networks / rank
 
Normal rank

Revision as of 23:58, 8 July 2024

scientific article
Language Label Description Also known as
English
Bound and exact methods for assessing link vulnerability in complex networks
scientific article

    Statements

    Bound and exact methods for assessing link vulnerability in complex networks (English)
    0 references
    0 references
    0 references
    0 references
    5 September 2014
    0 references
    vulnerability assessment
    0 references
    pairwise connectivity
    0 references
    integer programming
    0 references
    spectral bound
    0 references

    Identifiers