doi: 10.5281/zenodo.20557942
Code accompanying the paper "k-local Graphs", which extends the notion of k-locality to coloured graphs and proposes a priority search algorithm to compute the k-locality of a graph, orders of magnitude faster than exhaustive search.