Balancing minimum spanning trees and shortest-path trees (Q1899219): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+On sparse spanners of weighted graphs
@@ Property / cites work: On sparse spanners of weighted graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Routing to Multiple Destinations in Computer Networks
+Normal rank
@@ Property / cites work @@
+NEW SPARSENESS RESULTS ON GRAPH SPANNERS
@@ Property / cites work: NEW SPARSENESS RESULTS ON GRAPH SPANNERS / rank @@
+Normal rank
@@ Property / cites work @@
+There are planar graphs almost as good as the complete graph
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
+Normal rank
@@ Property / cites work @@
+On the shortest spanning subtree of a graph and the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees
+Normal rank
@@ Property / cites work @@
+An Optimal Synchronizer for the Hypercube
@@ Property / cites work: An Optimal Synchronizer for the Hypercube / rank @@
+Normal rank
@@ Property / cites work @@
+Q3694703
@@ Property / cites work: Q3694703 / rank @@
+Normal rank
@@ Property / cites work @@
+A sparse graph almost as good as the complete graph on points in \(k\) dimensions
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01294129
+Normal rank
@@ Property / OpenAlex ID @@
+W2951475756
@@ Property / OpenAlex ID: W2951475756 / rank @@
+Normal rank