Facts The Ford-Fulkerson method is iterative This method depends on three ideas: Augmenting paths Residual networks Cuts Simplified Pseudo-code: initialize flow f to 0 while there exist an augmenting path p do augmented flow f along p return f Augmenting Paths An augmenting path is a simple path from source to sing in the residual […]
The Clique Problem The clique problem is an optimization problem where we ask if a clique (complete subgraphs) of a given size exists in the graph. The idea is to find the clique maximum size in a graph. List of Facts A clique in a undirected graph is a subset of vertices Each pair of […]
Definition The capacity constrain indicate that a given capacity must not be exceed by the flow from one vertex to another. The skew symmetry (a notational convenience) indicate that the flow from vertex to vertex is the negative of the flow in the reverse direction. The flow-conservation property indicate that the total flow out of […]
There is no excerpt because this is a protected post.
< Previous (Operative Systems – Part 5) | (Operative Systems – Part 7) Next > NOTIFICATION: These notes are published for educational purposes. Using these notes is under your own responsibility and risk. These notes are given ‘as is’. I do not take responsibilities for how you use them. PDF Content: Least recently used (LRU) […]