An algorithm for tree-realizability of distance matrices<sup>∗</sup> (Q3477951): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1080/00207169008803874
+Normal rank
@@ Property / OpenAlex ID @@
+W2013896824
@@ Property / OpenAlex ID: W2013896824 / rank @@
+Normal rank
@@ Property / cites work @@
+A fast algorithm for constructing trees from distance matrices
+Normal rank
@@ Property / cites work @@
+On optimal embeddings of metrics in graphs
@@ Property / cites work: On optimal embeddings of metrics in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the tree realizability of a distance matrix
+Normal rank
@@ Property / cites work @@
+A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices
+Normal rank
@@ Property / cites work @@
+A note on distance matrices with unicyclic graph realizations
+Normal rank
@@ Property / cites work @@
+Submatrices of non-tree-realizable distance matrices
+Normal rank