Article ID: | iaor20023719 |
Country: | United States |
Volume: | 31 |
Issue: | 4 |
Start Page Number: | 530 |
End Page Number: | 547 |
Publication Date: | Dec 2001 |
Journal: | Algorithmica |
Authors: | Das B., Loui M.C. |
Updating a minimum spanning tree (MST) is a basic problem for communication networks. In this paper we consider single node deletions in MSTs. Let