On the complexity of feedback set problems in signed digraphs (Q3503560): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:51, 4 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of feedback set problems in signed digraphs |
scientific article |
Statements
On the complexity of feedback set problems in signed digraphs (English)
0 references
5 June 2008
0 references
feedback set problems
0 references
NP-completeness
0 references
signed digraph
0 references
regulatory Boolean networks
0 references
