  The optimal calculation order of a computational graph can be represented by
a set of algebraic expressions. Computational graph and algebraic expression
both have close relations and significant differences, this paper looks into
these relations and differences, making plain their interconvertibility. By
revealing different types of multiplication relations in algebraic expressions
and their elimination dependencies in line-graph, we establish a theoretical
limit on the efficiency of face elimination.
