The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects (Q2346581): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.ejc.2015.02.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2938842210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bootstrap percolation in living neural networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bootstrap percolation on the hypercube / 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: Bootstrap percolation in three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bootstrap Percolation in High Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random disease on the square grid / 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: The time of bootstrap percolation with dense initial sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Elementary Properties of Interval Convexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irreversible conversion of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4780500 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximability of Influence in Social Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability Results for Graph Convexity Parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Multiterminal Cuts / 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: Convex sets in graphs. II: Minimal path convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on simple tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity in Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Growth rates and explosions in sandpiles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp metastability threshold for two-dimensional bootstrap percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5807392 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Formulae and Their Uses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal percolating sets in bootstrap percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal percolation time in hypercubes under 2-bootstrap percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Largest minimal percolating sets in hypercubes under 2-bootstrap percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141898 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:42, 10 July 2024

scientific article
Language Label Description Also known as
English
The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects
scientific article

    Statements

    The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects (English)
    0 references
    0 references
    2 June 2015
    0 references
    polynomial time algorithms for trees
    0 references
    polynomial time algorithms for chordal graphs
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers