1000/1000
Hot
Most Recent
There is no comment~
More
The graph burning problem is an NP-hard combinatorial optimization problem that helps quantify how vulnerable is a graph to contagion.