Efficient MFS algorithms in regular polygonal domains.
Andreas KarageorghisPublished in: Numer. Algorithms (2009)
Keyphrases
- computationally expensive
- computationally efficient
- computationally intensive
- orders of magnitude
- times faster
- computationally complex
- data structure
- significant improvement
- real world
- highly efficient
- recently developed
- theoretical analysis
- optimization problems
- computational complexity
- neural network
- benchmark datasets
- computational efficiency
- computational cost
- graph theory
- face recognition
- search problems
- single pass
- highly scalable
- incremental algorithms