14. The method of claim 13 , wherein each edge further has an associated weight, and wherein determining if the number of paths in the graph between the pair of nodes in the graph that include an edge from the subgraph exceeds the threshold comprises determining if a sum of the weights of the edges of each path between the pair of nodes in the graph that include an edge from the subgraph exceeds the threshold.
14. The method of claim 13 , wherein each edge further has an associated weight, and wherein determining if the number of paths in the graph between the pair of nodes in the graph that include an edge from the subgraph exceeds the threshold comprises determining if a sum of the weights of the edges of each path between the pair of nodes in the graph that include an edge from the subgraph exceeds the threshold. 15. The method of claim 14 , wherein determining if the sum of the weights of the edges of each path between the pair of nodes in the graph that include an edge from the subgraph exceeds the threshold further comprises determining if a sum of a minimum weight edge of each path between the pair of nodes in the graph that include an edge from the subgraph exceeds the threshold.