Conservation of alternative paths as a method to simplify large networks
Ling Liu, Raúl J. Mondragón · 2009
We introduce an algorithm to reduce the size of a network conserving the number of alternative paths. The algorithm is based on node contraction and it can take into consideration properties like direction, capacity or flow that goes through the network's link. The algorithm is applied to the Internet network to detect bottlenecks in the number of alternative paths in parts of the network.