Alejandro G. Carlstein Ramos Mejia Blog



Archive for the ‘Algorithms’ Category

Facts The Ford-Fulkerson method  is iterative This method depends on three ideas: Augmenting paths Residual networks Cuts Simplified Pseudo-code: initialize … Learn more

Share

The Clique Problem The clique problem is an optimization problem where we ask if a clique (complete subgraphs) of a … Learn more

Share

Definition The capacity constrain indicate that a given capacity must not be exceed by the flow from one vertex to … Learn more

Share