Assertion: graph's vertex | /r/CapableOf | minimize the sum of distances
Facets:
Source sentences:
text: Bandelt & Barthélémy (1984) study more generally the problem of finding the vertex minimizing the sum of distances to each of a given set of vertices, and show that it has a unique solution for any odd number of vertices in a median graph.
text: of a graph measures the amount of lookahead needed to optimally solve a problem in which one is given a sequence of graph vertices , and must find as output another sequence of vertices minimizing the sum of the distances and .
text: Bandelt & Barthélémy (1984) study more generally the problem of finding the vertex minimizing the sum of distances to each of a given set of vertices, and show that it has a unique solution for any odd number of vertices in a median graph.