An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph.
Elias DahlhausMarek KarpinskiPublished in: Theor. Comput. Sci. (1994)
Keyphrases
- parallel algorithm
- parallel computation
- spatial join
- parallel programming
- shared memory
- cluster of workstations
- discovery of association rules
- binary search trees
- parallel implementations
- graph structure
- structured data
- medial axis transform
- processor array
- partial order
- multi dimensional
- parallel version
- dominant points
- search algorithm
- databases