Medians in median graphs and their cube complexes in linear time

The median of a set of vertices P of a graph G is the set of all vertices x of G minimizing the sum of distances from x to all vertices of P. In this paper, we present a linear time algorithm to compute medians in median graphs. We also present a linear time algorithm to compute medians in the assoc...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of computer and system sciences 2022-06, Vol.126, p.80-105
Hauptverfasser:	Bénéteau, Laurine, Chalopin, Jérémie, Chepoi, Victor, Vaxès, Yann
Format:	Artikel
Sprache:	eng
Schlagworte:	CAT cube complex Combinatorics Computational Geometry Computer Science Data Structures and Algorithms Discrete Mathematics Event structures LexBFS Linear time algorithm Mathematics Median graph Median problem Metric Geometry
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!