Paths and Intersections: Repelling PairsResearch Paper
The distance realization problem asks, given a metric on a finite set of terminals and a family of graphs, whether some graph in the family with nonnegative edge lengths, possibly with extra Steiner vertices, has shortest-path metric exactly on . The question goes back to Hakimi and Yau (1965) and appears in phylogenetics, hierarchical classification…