![]() In the sequential case multiple update problems may be solved using repeated applications of an efficient algorithm for a single update. Multiple update problems for MSTs are concerned with handling more than one such change. ![]() ![]() These updates allowed a single change in the underlying graph, such as a change in the cost of an edge or an insertion of a new vertex. Parallel updates of minimum spanning trees (MSTs) have been studied in the past.
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |