'Limit flow' presentation slideshows

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}

400 views • 11 slides