A note on bipartite graphs and pivot selection in sparse matrices

In this note a bipartite graph representation is proposed for the study of pivot strategies on sparse matrices. Using this representation, an algorithm which fullfills the Brayton's condition for Gaussian elimination optimality has been devised.