A self-stabilizing memory efficient algorithm for the minimum diameter spanning tree under an omnipotent daemon.
Lélia BlinFadwa BoubekeurSwan DuboisPublished in: J. Parallel Distributed Comput. (2018)
Keyphrases
- memory efficient
- spanning tree
- learning algorithm
- computational complexity
- minimum spanning tree
- optimal solution
- np hard
- minimum cost
- edge disjoint
- multiple sequence alignment
- matching algorithm
- k means
- external memory
- matching process
- memory requirements
- edge weights
- search space
- objective function
- root node
- total length
- minimum total cost
- multimedia