Time complexity of practical parallel steiner point insertion algorithms.
Daniel A. SpielmanShang-Hua TengAlper ÜngörPublished in: SPAA (2004)
Keyphrases
- worst case
- computational complexity
- orders of magnitude
- computational cost
- space complexity
- data structure
- real world
- theoretical analysis
- computationally efficient
- learning algorithm
- np hard
- recently developed
- parallel architectures
- np complete
- significant improvement
- benchmark datasets
- clustering algorithm
- computational efficiency
- social networks
- high computational complexity
- computationally demanding
- parallel implementations
- computationally complex
- parallel hardware