Showing papers on "Weighted network published in 1995"

TL;DR: An O( n 2 + nω ) time algorithm is developed to solve the decision problem to determine, for each communicating pair of nodes, the time when the communication will break down due to insufficient capacity of arcs in the network.