 |
We propose an algorithm that is based on the max-flow min cut theory, that was developed in 1950 by Fulkerson and Shannon. Its is a polynomial time algorithm meaning the algorithm can solve a problem optimally in polynomial time bounded by an upper bound equal to the number of edges time the maximum number of packet flows. The MFMC identifies the minimum number of edges with maximum flow capacity such that if removed it will partition the network in that the source node is disconnected from the destination.
|
IEEE/ICACT20210213 Slide.06
[Big Slide]
[YouTube]