An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph (Extended Abstract)
Elias DahlhausMarek KarpinskiPublished in: FOCS (1989)
Keyphrases
- extended abstract
- parallel algorithm
- parallel computation
- shared memory
- spatial join
- parallel version
- parallel programming
- structured data
- graph structure
- parallel implementations
- discovery of association rules
- cluster of workstations
- database systems
- binary search trees
- memory efficient
- multi dimensional
- xml documents