Answers are grounded in this paper and cite their sources.
The results of Hakimi and Yau and others in the realization of a distance matrix are generalized to graphs (digraphs) whose branches (arcs) may have negative weights. Conditions under which such matrices have a tree, hypertree or directed tree realization are given, uniqueness of these realizations is discussed and algorithms for their construction are indicated.
No takes yet. Share an insight, caveat, or question.
Patrinos et al. (1972) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: