Keywords: Shortest paths, network backbone, minimum spanning trees, sparsification
TL;DR: We demonstrate that the ultrametric backbone is the union of minimum spanning forests in undirected graphs and provides a new generalization of minimum spanning trees to directed graphs.
Submission Number: 86
Loading