Parameterized Complexity of Graph Burning
From MaRDI portal
Recommendations
Cites work
- An upper bound on the burning number of graphs
- Approximating rank-width and clique-width quickly
- Approximation algorithms for graph burning
- Bounds on the burning number
- Bounds on the burning numbers of spiders and path-forests
- Burning a graph as a model of social contagion
- Burning a graph is hard
- Burning graphs: a probabilistic perspective
- Burning number of caterpillars
- Burning number of graph products
- Burning number of theta graphs
- Burning numbers of path forests and spiders
- Burning spiders
- Burning the plane. Densities of the infinite Cartesian grid
- Burning two worlds
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Graph burning: tight bounds on the burning numbers of path forests and spiders
- Graph-Theoretic Concepts in Computer Science
- How to Burn a Graph
- scientific article; zbMATH DE number 3632548 (Why is no real title available?)
- scientific article; zbMATH DE number 1507224 (Why is no real title available?)
- Kernel bounds for disjoint cycles and disjoint paths
- Kernelization lower bounds through colors and IDs
- Linear time solvable optimization problems on graphs of bounded clique-width
- On the Relationship Between Clique-Width and Treewidth
- Parameterized algorithms
- Parameterized algorithms for Graph Burning problem
- Parameterized Algorithms for Modular-Width
- Sparsity. Graphs, structures, and algorithms
- The behavior of clique-width under graph operations and graph transformations
- The burning number of directed graphs: bounds and computational complexity
Cited in
(3)
This page was built for publication: Parameterized Complexity of Graph Burning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6089668)
