A fast and usually linear algorithm for global flow analysis (abstract only)
ible graphs is presented. The algorithm is shown to treat a very general class of function spaces. For a graph of e edges, the algorithm has a worst case time bound of…