Runtime comparisions of algorithms.

<p>The simulation results for 3,600 randomly generated Boolean networks (BN) with maximum indegree <i>K</i>. Each dot is the median value computed for 100 networks. A: Median runtime of algorithms for BN with <i>K</i> = 2. B: Median runtime of algorithms for BN with <i>K</i> = 3. C: Median runtime of algorithms for BN with <i>K</i> = 4. D: Median runtime of algorithms for BN with <i>K</i> = 5.