A Graph Theoretic Approach to Solve Special Knapsack Problems in Polynomial Time (Q4685763): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-89920-6_40
+Normal rank
@@ Property / OpenAlex ID @@
+W2804967896
@@ Property / OpenAlex ID: W2804967896 / rank @@
+Normal rank
@@ Property / cites work @@
+Ond-threshold graphs andd-dimensional bin packing
@@ Property / cites work: Ond-threshold graphs andd-dimensional bin packing / rank @@
+Normal rank
@@ Property / cites work @@
+Q4165164
@@ Property / cites work: Q4165164 / rank @@
+Normal rank
@@ Property / cites work @@
+Directed path-width and directed tree-width of directed co-graphs
+Normal rank
@@ Property / cites work @@
+Q5503435
@@ Property / cites work: Q5503435 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs
+Normal rank
@@ Property / cites work @@
+Threshold graphs and related topics
@@ Property / cites work: Threshold graphs and related topics / rank @@
+Normal rank
@@ Property / cites work @@
+Q4346044
@@ Property / cites work: Q4346044 / rank @@
+Normal rank
@@ Property / cites work @@
+An \(O(n^3)\) time algorithm for recognizing threshold dimension 2 graphs
+Normal rank
@@ Property / cites work @@
+The Complexity of Counting in Sparse, Regular, and Planar Graphs
+Normal rank
@@ Property / cites work @@
+The Complexity of the Partial Order Dimension Problem
+Normal rank