A new O(n log n) scheduling heuristic for parallel decomposition of sparse matrices | IEEE Conference Publication | IEEE Xplore