Worst Case Complexity of Parallel Triangular Mesh Refinement by Longest Edge Bisection.
Can C. ÖzturanPublished in: PPSC (1997)
Keyphrases
- worst case
- upper bound
- space complexity
- lower bound
- average case
- mesh refinement
- np hard
- approximation algorithms
- parallel processing
- greedy algorithm
- error bounds
- computational complexity
- running times
- edge information
- maximum number
- distributed memory
- complexity bounds
- vertex set
- computational cost
- parallel computation
- worst case analysis