Solving the Distance-Based Critical Node Problem (Q5087707): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1287/ijoc.2021.1136 / 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: Hybrid constructive heuristics for the critical node problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient methods for the distance-based critical node detection problem in complex networks / 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: Detecting critical nodes in sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Length-bounded cuts and flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the monotonization of polyhedra / 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: A faster algorithm for betweenness centrality* / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Imposing Connectivity Constraints in Forest Planning Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer linear programming formulation for removing nodes in a network to minimize the spread of influenza virus infections / rank
 
Normal rank
Property / cites work
 
Property / cites work: The wireless network jamming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended formulations in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The university of Florida sparse matrix collection / 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: Branch and cut algorithms for detecting critical nodes in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thinning out Steiner trees: a node-based model for uniform edge costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The critical node detection problem in networks: a survey / 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: Parsimonious formulations for low-diameter clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Epidemic dynamics on complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Optimal Design of Low-Latency Virtual Backbones / 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: Selected Topics in Critical Element Detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting critical node structures on graphs: A mathematical programming approach / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1287/IJOC.2021.1136 / rank
 
Normal rank

Latest revision as of 15:52, 30 December 2024

scientific article; zbMATH DE number 7552209
Language Label Description Also known as
English
Solving the Distance-Based Critical Node Problem
scientific article; zbMATH DE number 7552209

    Statements

    Solving the Distance-Based Critical Node Problem (English)
    0 references
    0 references
    0 references
    1 July 2022
    0 references
    critical node
    0 references
    distance constraint
    0 references
    integer program
    0 references
    branch-and-cut
    0 references
    network interdiction
    0 references
    dominant
    0 references
    partial dominant
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers