Efficient methods for the distance-based critical node detection problem in complex networks (Q2668688): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(9 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Eduardo L. Pasiliao / rank
Normal rank
 
Property / author
 
Property / author: Eduardo L. Pasiliao / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: NetworkX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GraphBase / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Gurobi / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Pajek / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Pajek datasets / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2021.105254 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3131340246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of survivable networks with vulnerability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hop‐level flow formulation for the survivable network design with hop constraints problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-cut methods for the network design problem with vulnerability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting critical nodes in sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cardinality-Constrained Critical Node Detection Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods for removing links in a network to minimize the spread of infections / 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: Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure / 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: Exact identification of critical nodes in sparse networks via new compact formulations / 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: Exact interdiction models and algorithms for disconnecting networks via node deletions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the critical node problem over trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid constructive heuristics for the critical node problem / rank
 
Normal rank
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: Centrality Analysis for Modified Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer programming framework for critical elements detection in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information theory perspective on network robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of scale-free networks: Error and attack tolerance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140399 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Community structure in social and biological networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Emergence of Scaling in Random Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267900 / rank
 
Normal rank

Latest revision as of 06:09, 28 July 2024

scientific article
Language Label Description Also known as
English
Efficient methods for the distance-based critical node detection problem in complex networks
scientific article

    Statements

    Efficient methods for the distance-based critical node detection problem in complex networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 March 2022
    0 references
    0 references
    critical node problem
    0 references
    distance connectivity
    0 references
    integer programming
    0 references
    lazy constraints
    0 references
    breadth first search
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references