Improved Worst-Case Deterministic Parallel Dynamic Minimum Spanning Forest.
Tsvi KopelowitzEly PoratYair RosenmutterPublished in: SPAA (2018)
Keyphrases
- worst case
- parallel processing
- dynamic environments
- neural network
- dynamically changing
- approximation algorithms
- greedy algorithm
- error bounds
- artificial neural networks
- lower bound
- image sequences
- changing environment
- shared memory
- parallel implementation
- average case
- computer architecture
- databases
- parallel programming