Minimizing Setups for Ordered Sets: A Linear Algebraic Approach (Q3665161): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1137/0604016
@@ Property / full work available at URL: https://doi.org/10.1137/0604016 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1988363261
@@ Property / OpenAlex ID: W1988363261 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3890731
@@ Property / cites work: Q3890731 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5646916
@@ Property / cites work: Q5646916 / rank @@
+Normal rank
@@ Property / cites work @@
+The Jump Number of Dags and Posets: An Introduction
+Normal rank
@@ Property / cites work @@
+Q4200070
@@ Property / cites work: Q4200070 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing Setups for Cycle-Free Ordered Sets
@@ Property / cites work: Minimizing Setups for Cycle-Free Ordered Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Scheduling under Precedence Constraints
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3665161