An algorithm for the most economic link addition in a tree communications network (Q1259541): Difference between revisions

@@ Property / author @@
-Frank Ruskey
@@ Property / author: Frank Ruskey / rank @@
-Normal rank
@@ Property / author @@
+Frank Ruskey
@@ Property / author: Frank Ruskey / rank @@
+Normal rank
@@ 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.1016/0020-0190(79)90062-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2008994387
@@ Property / OpenAlex ID: W2008994387 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimum addition of an edge to a path
@@ Property / cites work: Optimum addition of an edge to a path / rank @@
+Normal rank
@@ Property / cites work @@
+Optimum Communication Spanning Trees
@@ Property / cites work: Optimum Communication Spanning Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Linear algorithms on recursive representations of trees
+Normal rank
@@ Property / cites work @@
+A method and two algorithms on the theory of partitions
+Normal rank