We provide an alternative proof of the result of Rose (1972) that all perfect (no-fill) orderings of a symmetric sparse matrix require the same number of arithmetic operations during triangular factorization and show that such a result does not hold for unsymmetric sparse matrices.