The ultrametric backbone is the union of all minimum spanning forests

NetSciX 2026 Conference Submission86 Authors

06 Sept 2025 (modified: 27 Sept 2025)NetSciX 2026 Conference SubmissionEveryoneRevisionsBibTeXCC BY-SA 4.0
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