Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth (Q2444525): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.dam.2013.03.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2054950944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / 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: Q4734761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / 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: Complexity of the critical node problem over trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / 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: A cutting plane algorithm for computing \(k\)-edge survivability of a network / 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: The maximum edge biclique problem is NP-complete / 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: How to Cut a Graph into Many Pieces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removing Arcs from a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic network interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Epidemic dynamics on complex networks / rank
 
Normal rank

Latest revision as of 14:04, 7 July 2024

scientific article
Language Label Description Also known as
English
Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
scientific article

    Statements

    Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth (English)
    0 references
    0 references
    0 references
    0 references
    10 April 2014
    0 references
    critical node problem
    0 references
    treewidth
    0 references
    complexity
    0 references
    dynamic programming
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references