Data underlying the publication: Graph Coarsening for Fugitive Interception

This repository is part of the Ph.D. thesis of Irene S. van Droffelaar, Delft University of Technology.<br><em>coarseningFIP.zip </em>contains all algorithms and data accompanying the paper "Graph Coarsening for Fugitive Interception":Directories <em>pruning</em>, <em>consolidate_nodes</em>, <em>heuristic</em>, and <em>onthefly</em> contain the algorithms for graph coarsening. The <em>heuristic</em> coarsening algorithm is the Python implementation of the algorithm proposed by Krishnakumari et al. (2020) and can also be found in <em>heuristic_coarsening.zip</em> and https://github.com/irene-sophia/HeuristicCoarsening.The directory <em>HPC_results</em> contains the results of the experiments for all five road networks for all algorithms.The directory <em>analysis</em> contains the notebooks that analyze the experiments, also including the cross-evaluation, counting the numbers of nodes in each network, and the timing experiments. Most plots in the paper are generated in the <em>compare_methods.ipynb</em> notebook.The directory <em>data</em> contains the coarsened networks resulting from each algorithm, and the simulated routes.The directory <em>route_simulation</em> contains the route generation code.<br><em>platypus-fork.zip</em> contains the optimization algorithm.<br>