We do not
attempt to present an overview
here, but rather attempt to focus on those results that
are relevant to our particular algorithm.
This section assumes prior knowledge of the role of graph theory
in sparse Gaussian elimination; surveys of this role are
available in [1]} and [2]}. More general
discussions of elimination trees are given in
[3]} - [4]}, [5]}.
Thus, at the \(k\) th stage, the bordering algorithm consists of
solving the lower triangular system
\( L_{k-1}v = c\) 
