A Row Generation Algorithm for Finding Optimal Burning Sequences of Large Graphs - Complementary Data

Description

This dataset contains complementary data to the paper "A Row Generation Algorithm for Finding Optimal Burning Sequences of Large Graphs" [1], which proposes an exact algorithm for the Graph Burning Problem, an NP-hard optimization problem that models a form of contagion diffusion on social networks. Concerning the computational experiments discussed in that paper, we make available: - Four sets of instances; - The optimal (or best known) solutions obtained; - The source code; - An Appendix with additional details about the results. The "delta" input sets include graphs that are real-world networks [1,2], while the "grid" input set contains graphs that are square grids. The directories "delta_10K_instances", "delta_100K_instances", "delta_4M_instances" and "grid_instances" contain files that describe the sets of instances. The first two lines of each file contain: <n> <m> where <n> and <m> are the number of vertices and edges in the graph. Each of the next <m> lines contains: <u> <v> where <u> and <v> identify a pair of vertices that determines an undirected edge. The directories "delta_10K_solutions", "delta_100K_solutions", "delta_4M_solutions" and "grid_solutions" contain files that describe the optimal (or best known) solutions for the corresponding sets of instances. The first line of each file contains: <s> where <s> is the number of vertices in the burning sequence. Each of the next <s> lines contains: <v> where <v> identifies a fire source. The fire sources are listed in the same order that they appear in a burning sequence of length <s>. The directory "source_code" contains the implementations of the exact algorithm proposed in the paper [1], namely, PRYM. Lastly, the file "appendix.pdf" presents additional details on the results reported in the paper. This work was supported by grants from Santander Bank, Brazil, Brazilian National Council for Scientific and Technological Development (CNPq), Brazil, São Paulo Research Foundation (FAPESP), Brazil and Fund for Support to Teaching, Research and Outreach Activities (FAEPEX). Caveat: the opinions, hypotheses and conclusions or recommendations expressed in this material are the sole responsibility of the authors and do not necessarily reflect the views of Santander, CNPq, FAPESP or FAEPEX. References [1] F. C. Pereira, P. J. de Rezende, T. Yunes and L. F. B. Morato. A Row Generation Algorithm for Finding Optimal Burning Sequences of Large Graphs. Submitted. 2024. [2] Jure Leskovec and Andrej Krevl. SNAP Datasets: Stanford Large Network Dataset Collection. 2024. https://snap.stanford.edu/data [3] Ryan A. Rossi and Nesreen K. Ahmed. The Network Data Repository with Interactive Graph Analytics and Visualization. In: AAAI, 2022. https://networkrepository.com

Steps to reproduce

1. Modify the first line of the Makefile to configure the path to the Gurobi installation folder in your machine. 2. Open a terminal in the "source_code" directory and run the 'make' command. This will compile the source code and create an executable file named "program". 3. To run the program, execute the following command in your terminal: ./program -input_path <path_to_instance_folder>/<instance_name>.mtx where <path_to_instance_folder> denotes the path to the directory containing the instance file, <instance_name> indicates the name of the instance. At the end of the execution, the program will write an optimal solution in a file named <instance_name>.sol. The following argument is optional: -threads : maximum number of threads of execution (default 1) To run the program, execute the following command in your terminal: ./program -input_path <path_to_instance_folder>/<instance_name>.mtx where <path_to_instance_folder> denotes the path to the directory containing the instance file, <instance_name> indicates the name of the instance. In the end of the execution, the program will write an optimal solution in a file named <instance_name>.sol. The following argument is optional: -threads : maximum number of threads of execution (default 1);

Institutions

Categories

Funding

Licence