The Min-Max Spanning Tree Problem and some extensions (Q1244239): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(78)90030-3
+Normal rank
@@ Property / OpenAlex ID @@
+W1968182342
@@ Property / OpenAlex ID: W1968182342 / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational power of pushdown automata
@@ Property / cites work: On the computational power of pushdown automata / rank @@
+Normal rank
@@ Property / cites work @@
+Q4133397
@@ Property / cites work: Q4133397 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Minimum Spanning Trees
@@ Property / cites work: Finding Minimum Spanning Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Two Algorithms for Generating Weighted Spanning Trees in Order
+Normal rank
@@ Property / cites work @@
+Parallel concepts in graph theory
@@ Property / cites work: Parallel concepts in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q4130999
@@ Property / cites work: Q4130999 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the median
@@ Property / cites work: Finding the median / rank @@
+Normal rank
@@ Property / cites work @@
+Finding optimum branchings
@@ Property / cites work: Finding optimum branchings / rank @@
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees
+Normal rank