Figure 5From: Steiner tree methods for optimal sub-network identification: an empirical studyComputation time ( s ) of different heuristic Steiner algorithms, the exact PCST method and the belief propagation approximation (BP) on log_{1 0} scale. For |E| ≥ 50 the PCST algorithm became impractically slow. The same was true for the ASP algorithm for |E| = 150.Back to article page