On the complexity of feedback set problems in signed digraphs (Q3503560): 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.1016/j.endm.2008.01.043
+Normal rank
@@ Property / OpenAlex ID @@
+W2016743899
@@ Property / OpenAlex ID: W2016743899 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum number of fixed points in regulatory Boolean networks
+Normal rank
@@ Property / cites work @@
+Q3145802
@@ Property / cites work: Q3145802 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+Permanents, Pfaffian orientations, and even directed circuits
+Normal rank
@@ Property / cites work @@
+Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3503560