Pages that link to "Item:Q5348493"
From MaRDI portal
The following pages link to Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks (Q5348493):
Displaying 16 items.
- Complexity of limit-cycle problems in Boolean networks (Q831798) (← links)
- Boolean networks: beyond generalized asynchronicity (Q1656683) (← links)
- Positive and negative cycles in Boolean networks (Q1717061) (← links)
- Bilevel integer programming on a Boolean network for discovering critical genetic alterations in cancer development and therapy (Q2116889) (← links)
- Complexity of fixed point counting problems in Boolean networks (Q2119407) (← links)
- The complexity of the asynchronous prediction of the majority automata (Q2201796) (← links)
- Counting periodic points in parallel graph dynamical systems (Q2210298) (← links)
- Optimising attractor computation in Boolean automata networks (Q2232265) (← links)
- Existence, coexistence and uniqueness of fixed points in parallel and sequential dynamical systems over directed graphs (Q2246963) (← links)
- On the stability and instability of finite dynamical systems with prescribed interaction graphs (Q2318780) (← links)
- Nilpotent dynamics on signed interaction graphs and weak converses of Thomas' rules (Q2322880) (← links)
- Fixed points in conjunctive networks and maximal independent sets in graph contractions (Q2361351) (← links)
- Recent techniques and results on the Erdős-Pósa property (Q2403789) (← links)
- Attractor separation and signed cycles in asynchronous Boolean networks (Q2682936) (← links)
- On the influence of the interaction graph on a finite dynamical system (Q6151155) (← links)
- Concurrency in Boolean networks (Q6151158) (← links)
