On handling vertex deletion in updating spanning trees

Authors:
Yung Hyang Tsin
Affiliations:
Univ. of Windsor, Windsor, Ont., Canada
Venue:
Information Processing Letters
Year:
1988

Citing 0
Cited 2

Associative parallel algorithm for dynamic reconstruction of a minimum spanning tree after deletion of a vertex

PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
Distributed computation of all node replacements of a minimum spanning tree

Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing

Quantified Score

Hi-index	0.89

Visualization

Abstract