On the complexity of feedback set problems in signed digraphs (Q3503560): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.endm.2008.01.043 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2016743899 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximum number of fixed points in regulatory Boolean networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3145802 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4142699 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Permanents, Pfaffian orientations, and even directed circuits / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs / rank | |||
Normal rank | |||
Revision as of 10:23, 28 June 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
