The minimum labeling spanning trees (Q1567492): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q56077967
@@ Property / Wikidata QID: Q56077967 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4040055
@@ Property / cites work: Q4040055 / rank @@
+Normal rank
@@ Property / cites work @@
+The Min-Max Spanning Tree Problem and some extensions
+Normal rank
@@ Property / cites work @@
+Most and least uniform spanning trees
@@ Property / cites work: Most and least uniform spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the \(k\) smallest spanning trees
@@ Property / cites work: Finding the \(k\) smallest spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+On finding most uniform spanning trees
@@ Property / cites work: On finding most uniform spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum Diameter Spanning Trees and Related Problems
+Normal rank
@@ Property / cites work @@
+Single path routing with delay considerations
@@ Property / cites work: Single path routing with delay considerations / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0020-0190(97)00127-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2048177396
@@ Property / OpenAlex ID: W2048177396 / rank @@
+Normal rank