COMPUTATION LIST EVALUATION AND ITS APPLICATIONS
Eliezer A. Albacea · Parallel Processing Letters · 1992
In this paper, we present an algorithm for a generalization of list ranking called computation list evaluation. As a consequence of the generalization and the existence of this algorithm for computation list evaluation, we obtain a generalization of Euler Tour technique. Finally, we present several applications of the generalized Euler Tour technique. Of interest in the applications is the identification of a set of problem instances that are solvable using tree contraction and which can alternatively be solved using a simple algorithm based on the generalized Euler Tour technique.