Approximation algorithms for graph burning
From MaRDI portal
approximation algorithmsgraph algorithmsgraph burning probleminformation disseminationsocial contagion
Recommendations
Cited in
(25)- Improved bounds for burning fence graphs
- Burning graph classes
- Parameterized complexity of graph burning
- Burning the plane. Densities of the infinite Cartesian grid
- Parameterized algorithms for Graph Burning problem
- Graph burning: tight bounds on the burning numbers of path forests and spiders
- Burning two worlds
- A survey of graph burning
- APX-hardness and approximation for the \(k\)-burning number problem
- APX-hardness and approximation for the \(k\)-burning number problem
- Parameterized Complexity of Graph Burning
- Improved and generalized algorithms for burning a planar point set
- Groups burning: analyzing spreading processes in community-based networks
- Burning and \(w\)-burning of geometric graphs
- Graph burning and non-uniform \(k\)-centers for small treewidth
- Approximation Algorithms for Graph Burning
- Graph burning in community-based networks
- The burning game on graphs
- Burning path-like and clique-like graphs
- Burn and win
- Approximation algorithms for the graph burning on cactus and directed trees
- A row generation algorithm for finding optimal burning sequences of large graphs
- Between burning and cooling: liminal burning on graphs
- Deterministic approximation algorithm for graph burning
- Burning grids and intervals
This page was built for publication: Approximation algorithms for graph burning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2327458)
