Abstract
Procedure graphs are directed graphs with arc labels denoting precedence, useful in modelling computer algorithms. Equivalent procedure graphs yield the same data outcome under identical inputs, yet imply different performance, cost and practicability; they offer opportunities for optimization through judicious selection. Examples are given together with observations on computer architecture.
Author supplied keywords
Cite
CITATION STYLE
Chen, T. C. (1991). Graphic equivalence and computer optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 532 LNCS, pp. 207–220). Springer Verlag. https://doi.org/10.1007/BFb0017391
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
