Some simplified NP-complete graph problems (Q1230637): Difference between revisions

@@ Property / cites work @@
+Optimal Linear Ordering
@@ Property / cites work: Optimal Linear Ordering / rank @@
+Normal rank
@@ Property / cites work @@
+Q5782525
@@ Property / cites work: Q5782525 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Q5675543
@@ Property / cites work: Q5675543 / rank @@
+Normal rank
@@ Property / cites work @@
+Permutation Graphs and Transitive Graphs
@@ Property / cites work: Permutation Graphs and Transitive Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4133108
@@ Property / cites work: Q4133108 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
+Normal rank
@@ Property / cites work @@
+Algorithms for a maximum clique and a maximum independent set of a circle graph
+Normal rank
@@ Property / cites work @@
+Fast algorithms for bin packing
@@ Property / cites work: Fast algorithms for bin packing / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5659589
@@ Property / cites work: Q5659589 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4066569
@@ Property / cites work: Q4066569 / rank @@
+Normal rank