An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph (Extended Abstract)

Elias Dahlhaus, Marek Karpinski

Browse the full FOCS paper archive.