A parallel algorithm is presented for the solution of a linear system A x = b with a sparse n × n symmetric positive definite matrix A utilizing properties of the graph G ( A ) that has n vertices and has an edge for each nonzero entry of A. The authors give an analysis of the computational cost related to the computer time and the number of processors.