Generating hard and diverse test sets for NP-hard graph problems (Q1805463): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4773298
@@ Property / cites work: Q4773298 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4099676
@@ Property / cites work: Q4099676 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+An introduction to the analysis of approximation algorithms
+Normal rank
@@ Property / cites work @@
+A test problem generator for the Steiner problem in graphs
+Normal rank
@@ Property / cites work @@
+On the complexity of test case generation for NP-hard problems
+Normal rank
@@ Property / cites work @@
+Maximum number of edges in connected graphs with a given domination number
+Normal rank
@@ Property / cites work @@
+Q4871064
@@ Property / cites work: Q4871064 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4763341
@@ Property / cites work: Q4763341 / rank @@
+Normal rank
@@ Property / cites work @@
+On the theory of graphs
@@ Property / cites work: On the theory of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5509541
@@ Property / cites work: Q5509541 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1805463