Deleting edges to restrict the size of an epidemic: a new application for treewidth (Q1635713): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
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: Easy problems for tree-decomposable graphs / 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: Fixed-parameter tractability of graph modification problems for hereditary properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic second-order evaluations on tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of vertex integrity and component order connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of some edge deletion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Parameterized Algorithms for Deletion to Split Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node-deletion problem for hereditary properties is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity and Approximability of Minimum Contamination Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some complexity results about threshold graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity classification of some edge modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the NP-hardness of edge-deletion and -contraction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-and edge-deletion NP-complete problems / rank
 
Normal rank

Revision as of 18:54, 15 July 2024

scientific article
Language Label Description Also known as
English
Deleting edges to restrict the size of an epidemic: a new application for treewidth
scientific article

    Statements

    Deleting edges to restrict the size of an epidemic: a new application for treewidth (English)
    0 references
    0 references
    0 references
    0 references
    1 June 2018
    0 references
    edge-deletion
    0 references
    treewidth
    0 references
    network epidemiology
    0 references
    graph contagion
    0 references
    0 references
    0 references
    0 references

    Identifiers

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