The P3 infection time is W[1]-hard parameterized by the treewidth (Q1705656): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Rudini Menezes Sampaio / rank
Normal rank
 
Property / author
 
Property / author: Rudini Menezes Sampaio / 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.ipl.2017.12.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2780415142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bootstrap percolation in living neural networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sharp threshold for bootstrap percolation in all dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum infection time in the geodesic and monophonic convexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On slowly percolating sets of minimal size in bootstrap percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Percolation Time in Two-Dimensional Bootstrap Percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability results related to monophonic convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results related to monophonic convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some colorful problems parameterized by treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of multiple-interval graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Growth rates and explosions in sandpiles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4904144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diffusion in Social Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141898 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:45, 15 July 2024

scientific article
Language Label Description Also known as
English
The P3 infection time is W[1]-hard parameterized by the treewidth
scientific article

    Statements

    The P3 infection time is W[1]-hard parameterized by the treewidth (English)
    0 references
    0 references
    0 references
    16 March 2018
    0 references
    computational complexity
    0 references
    infection time
    0 references
    \(P_3\) convexity
    0 references
    fixed parameter tractability
    0 references
    treewidth
    0 references

    Identifiers

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