'Interval partitioning' presentation slideshows

The Greedy Technique(Method)

450 views • 40 slides

Prof. Swarat Chaudhuri

COMP 482: Design and Analysis of Algorithms. Prof. Swarat Chaudhuri. Spring 2013 Lecture 6. Recap: Reachability game. Suppose you have a bipartite directed graph with nodes in the two partitions colored red and blue, and two players: Red and Blue.

215 views • 21 slides

Interval Partitioning of a Flow Graph

Interval Partitioning of a Flow Graph. Input: a flow graph G = (N, E, n 0 ). Output: a partition of G into a set of disjoint intervals. Method: for each n, compute I(n). I(n) := {n}; while there exists a node m ? n 0 all of whose predecessors are in I(n) do I(n) := I(n) ? {m}

248 views • 11 slides

Interval Partitioning of a Flow Graph

Interval Partitioning of a Flow Graph. Input: a flow graph G = (N, E, n 0 ). Output: a partition of G into a set of disjoint intervals. Method: for each n, compute I(n). I(n) := {n}; while there exists a node m ? n 0 all of whose predecessors are in I(n) do I(n) := I(n) ? {m}

197 views • 11 slides