A new algorithm for graph center computation and graph partitioning according to the distance to the center

10/05/2019

∙

by   Frédéric Protin, et al.

∙

0

∙

share

We propose a new algorithm for finding the center of a graph, as well as the rank of each node in the hierarchy of distances to the center. In other words, our algorithm allows to partition the graph according to nodes distance to the center. Moreover, the algorithm is parallelizable. We compare the performances of our algorithm with the ones of Floyd-Warshall algorithm, which is traditionally used for these purposes. We show that, for a large variety of graphs, our algorithm outperforms the Floyd-Warshall algorithm.