Pages that link to "Item:Q3503560"
From MaRDI portal
The following pages link to On the complexity of feedback set problems in signed digraphs (Q3503560):
Displaying 4 items.
- Maximum number of fixed points in regulatory Boolean networks (Q941144) (← links)
- Negative (and positive) circles in signed graphs: a problem collection (Q1643910) (← links)
- Complexity of fixed point counting problems in Boolean networks (Q2119407) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
