Burning Two Worlds
From MaRDI portal
Publication:3297761
DOI10.1007/978-3-030-38919-2_10zbMath1440.68190OpenAlexW3101417881MaRDI QIDQ3297761
Avery Miller, Kenny Zhang, Shahin Kamali
Publication date: 20 July 2020
Published in: SOFSEM 2020: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-38919-2_10
Social networks; opinion dynamics (91D30) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (8)
Burning grids and intervals ⋮ A survey of graph burning ⋮ Burning graph classes ⋮ Parameterized complexity of graph burning ⋮ Burning and \(w\)-burning of geometric graphs ⋮ Improved pyrotechnics: closer to the burning number conjecture ⋮ Parameterized Complexity of Graph Burning ⋮ Improved bounds for burning fence graphs
Cites Work
- Inferring contagion patterns in social contact networks with limited infection data
- Graph minors. III. Planar tree-width
- On the complexity of computing treelength
- S-functions for graphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Burning number of graph products
- An upper bound on the burning number of graphs
- Burning graphs: a probabilistic perspective
- Simplified weak Galerkin and new finite difference schemes for the Stokes equation
- Approximation algorithms for graph burning
- Bounds on the burning numbers of spiders and path-forests
- Tree-decompositions with bags of small diameter
- 3-colouring for dually chordal graphs and generalisations
- Burning a graph is hard
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Burning spiders
- Burning a Graph as a Model of Social Contagion
- Algorithmic Aspects of Vertex Elimination on Graphs
- A Characterization of Comparability Graphs and of Interval Graphs
- How to Burn a Graph
This page was built for publication: Burning Two Worlds
