NP-completeness of minimum spanner problems (Q1315465): Difference between revisions

@@ Property / cites work @@
+On sparse spanners of weighted graphs
@@ Property / cites work: On sparse spanners of weighted graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Easy problems for tree-decomposable graphs
@@ Property / cites work: Easy problems for tree-decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Reconstructing the shape of a tree from observed dissimilarity data
+Normal rank
@@ Property / cites work @@
+Tree Spanners
@@ Property / cites work: Tree Spanners / rank @@
+Normal rank
@@ Property / cites work @@
+Delaunay graphs are almost as good as complete graphs
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Generating Sparse 2-Spanners
@@ Property / cites work: Generating Sparse 2-Spanners / rank @@
+Normal rank
@@ Property / cites work @@
+Grid spanners
@@ Property / cites work: Grid spanners / rank @@
+Normal rank
@@ Property / cites work @@
+Graph spanners
@@ Property / cites work: Graph spanners / rank @@
+Normal rank
@@ Property / cites work @@
+Q3139291
@@ Property / cites work: Q3139291 / rank @@
+Normal rank