BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-75-526
       ENTRY:: August 23, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Graph theory and Gaussian elimination.
        TYPE:: Technical Report
      AUTHOR:: Tarjan, Robert Endre
        DATE:: November 1975
       PAGES:: 24
    ABSTRACT:: This paper surveys graph-theoretic ideas which apply to the
               problem of solving a sparse system of linear equations by
               Gaussian elimination. Included are a discussion of bandwidth,
               profile, and general sparse elimination schemes, and of two
               graph-theoretic partitioning methods. Algorithms based on
               these ideas are presented.
       NOTES:: [Adminitrivia V1/Prg/19950823]
         END:: STAN//CS-TR-75-526