### Description of instance files
The algorithms were tested on the benchmark instances used for comparison in Table 3 of the paper

    Garcia-Diaz, J., Rodriguez-Henriquez, L.M.X., Perez-Sansalvador, J.C., Pomares-Hernandez, S.E.;
    Graph burning: Mathematical formulations and optimal solutions.
    Mathematics 10(15), 2777 (2022).

These are downloadable from
https://github.com/jesgadiaz/GBP/tree/main/dataset
https://github.com/jesgadiaz/GreedyBurning/tree/main/dataset

### Description of experiment results

The results of the computational experiments are given as CSV files:

In the given order the column names specify
- instance name,
- cardinality of vertex set,
- cardinality of edge set,
- standard deviation of the vertex-degree,
- the examined value for `T`,
- the algorithm name,
- the modality of the algorithm,
- primal bound,
- dual bound,
- timelimit provided (for the MILP-based approaches)
- time (in seconds) actually needed by the run,
- correctness, i.e., if the solution passed an independent feasibility checker (`1` meaning correct)