Table 13 Empirical time complexities of OutdLastOne for SACP in scale-free network.
From: Algorithms and Complexity Analyses for Control of Singleton Attractors in Boolean Networks
| OutdLastOne |
|---|---|
0.1 |
|
0.167 |
|
0.2 |
|
