The minimum weight triangulation problem with few inner points (Q2495946): Difference between revisions

@@ Property / cites work @@
+Algorithms and Data Structures
@@ Property / cites work: Algorithms and Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-time instances of the minimum weight triangulation problem
+Normal rank
@@ Property / cites work @@
+DIAMONDS ARE NOT A MINIMUM WEIGHT TRIANGULATION'S BEST FRIEND
+Normal rank
@@ Property / cites work @@
+On \(\beta\)-skeleton as a subgraph of the minimum weight triangulation
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem with few inner points
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing a subgraph of the minimum weight triangulation
+Normal rank
@@ Property / cites work @@
+Minimal Triangulations of Polygonal Domains
@@ Property / cites work: Minimal Triangulations of Polygonal Domains / rank @@
+Normal rank
@@ Property / cites work @@
+Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation
+Normal rank
@@ Property / cites work @@
+Maximum weight triangulation and graph drawing
@@ Property / cites work: Maximum weight triangulation and graph drawing / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound for \(\beta\)-skeleton belonging to minimum weight triangulations
+Normal rank