On functional equivalences in a model for parallel computation

This paper is concerned with a class of parallel computations which can be represented by a graphical model called a computation graph. In particular, graphs which represent the same computed function are studied. Given an arbitrary but well-formed computation graph, a procedure is given for constructing a graph which is structurally simpler yet represents the same computed function. These simpler graphs have the advantage of being easier to analyze and realize