title: Find sparsest row in matrix
body: <p>I have a matrix in MATLAB, and I want to determine which row contains the most zeros. That is, I want to find the sparsest row (and column) in the matrix. Any way to do this more efficiently than looping with <code>mat(sum(mat==0,i)==i,:)</code>? Or is this the preferred method?</p>
  
  <p>I'm using this for an implementation of an LU-factorization by using "minimum-degree ordering heuristic" to solve a linear system.</p>