- 41 Downloads
A directed acyclic graph (dag, for short) in the shape of a diamond or a square represents the data dependencies observed in several different algorithms. It represents a straightforward way of computing the longest common subsequence of two strings [55, 6]. It also represents the rate determining data dependencies in an iteration of the Gauss-Siedel method used for numerically computing the solution of certain partial differential equations discretized by a five-point stencil .
Unable to display preview. Download preview PDF.