Figure 4From: Steiner tree methods for optimal sub-network identification: an empirical studyTerminal frequency (| S |/| V |) of constructed sub-networks with different heuristic Steiner tree algorithms, the exact PCST method and the belief propagation approximation (BP). For |E| ≥ 50 the PCST algorithm became impractical slow. The same was true for the ASP algorithm for |E| = 150.Back to article page