'Active vertices' presentation slideshows

A Simple Min-Cut Algorithm

A Simple Min-Cut Algorithm. Joseph Vessella Rutgers-Camden. The Problem. Input: Undirected graph G =( V , E ) Edges have non-negative weights Output: A minimum cut of G. Cut Example. Cut: set of edges whose removal disconnects G Min-Cut: a cut in G of minimum cost.

1.34k views • 55 slides

An almost linear fully dynamic reachability algorithm

342 views • 33 slides

Reachability in Directed Graph s

Reachability in Directed Graph s. Liam Roditty. G = (V,E). G = (V,E). ?. ?. ?. ?. u. u. v. v. Reachability. Strong Connectivity. Is there a directed path from u to v. Is there a directed path from u to v and from v to u. G = (V,E). ?. ?. u. v.

350 views • 33 slides