An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph | IEEE Conference Publication | IEEE Xplore