Spreading in graphs

DOI10.1016/J.DAM.2024.04.019MaRDI QIDQ6453073zbMATH OpenFDO

Authors Boštjan Brešar, T. Gologranc, Aysel Erey, Jaka Hedžet

Publication date 28 September 2023

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Immune sets in monotone infection rules. Characterization and complexity
• Deterministic bootstrap percolation on trees
• Burning a graph is hard
• Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
• The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects

Cited in

(1)

• Immune sets in monotone infection rules. Characterization and complexity

This page was built for publication: Spreading in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6453073)