Pages that link to "Item:Q2327458"
From MaRDI portal
The following pages link to Approximation algorithms for graph burning (Q2327458):
Displaying 15 items.
- Burning grids and intervals (Q831694) (← links)
- Improved bounds for burning fence graphs (Q2053737) (← links)
- Burning graph classes (Q2157835) (← links)
- Parameterized complexity of graph burning (Q2161013) (← links)
- Burning the plane. Densities of the infinite Cartesian grid (Q2227973) (← links)
- Parameterized algorithms for Graph Burning problem (Q2301751) (← links)
- Graph burning: tight bounds on the burning numbers of path forests and spiders (Q2657308) (← links)
- Burning Two Worlds (Q3297761) (← links)
- A survey of graph burning (Q4986283) (← links)
- APX-hardness and approximation for the \(k\)-burning number problem (Q5918792) (← links)
- APX-hardness and approximation for the \(k\)-burning number problem (Q5919106) (← links)
- Parameterized Complexity of Graph Burning (Q6089668) (← links)
- Burning and \(w\)-burning of geometric graphs (Q6103478) (← links)
- Approximation Algorithms for Graph Burning (Q6309522) (← links)
- Graph burning in community-based networks (Q6636996) (← links)