Optimal realisations of two-dimensional, totally-decomposable metrics

Sven Herrmann, Jack Koolen, Alice Lesser +2

A realisation of a metric $d$ on a finite set $X$ is a weighted graph $(G,w)$ whose vertex set contains $X$ such that the shortest-path distance between elements of $X$ considered…