Constructing (0,1)-matrices with large minimal defining sets (Q1675656): Difference between revisions

@@ Property / DOI @@
-.1016/j.laa.2017.09.022
@@ Property / DOI: 10.1016/j.laa.2017.09.022 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W2758794011
@@ Property / OpenAlex ID: W2758794011 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5484517
@@ Property / cites work: Q5484517 / rank @@
+Normal rank
@@ Property / cites work @@
+Matrices of zeros and ones with fixed row and column sum vectors
+Normal rank
@@ Property / cites work @@
+Defining Sets and Critical Sets in (0,1)‐Matrices
+Normal rank
@@ Property / cites work @@
+Q4432209
@@ Property / cites work: Q4432209 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4262245
@@ Property / cites work: Q4262245 / rank @@
+Normal rank
@@ Property / cites work @@
+A theorem on flows in networks
@@ Property / cites work: A theorem on flows in networks / rank @@
+Normal rank
@@ Property / cites work @@
+On the size of the minimum critical set of a Latin square
+Normal rank
@@ Property / cites work @@
+Q4826175
@@ Property / cites work: Q4826175 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3851094
@@ Property / cites work: Q3851094 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal Interchanges of (0, 1)-Matrices and Disjoint Circuits in a Graph
+Normal rank
@@ Property / DOI @@
+.1016/J.LAA.2017.09.022
@@ Property / DOI: 10.1016/J.LAA.2017.09.022 / rank @@
+Normal rank