Submatrices of non-tree-realizable distance matrices (Q1163034): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0024-3795(82)90001-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2090136731
@@ Property / OpenAlex ID: W2090136731 / rank @@
+Normal rank
@@ Property / cites work @@
+Properties of the distance matrix of a tree
@@ Property / cites work: Properties of the distance matrix of a tree / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the metric properties of trees
@@ Property / cites work: A note on the metric properties of trees / rank @@
+Normal rank
@@ Property / cites work @@
+Diagonal tree codes
@@ Property / cites work: Diagonal tree codes / rank @@
+Normal rank
@@ Property / cites work @@
+Distance matrix of a graph and its realizability
@@ Property / cites work: Distance matrix of a graph and its realizability / rank @@
+Normal rank
@@ Property / cites work @@
+Q3207003
@@ Property / cites work: Q3207003 / rank @@
+Normal rank
@@ Property / cites work @@
+The structure of distances in networks
@@ Property / cites work: The structure of distances in networks / rank @@
+Normal rank
@@ Property / cites work @@
+The distance matrix of a graph and its tree realization
+Normal rank
@@ Property / cites work @@
+Q5592942
@@ Property / cites work: Q5592942 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the tree realizability of a distance matrix
+Normal rank
@@ Property / cites work @@
+The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
+Normal rank