On handling vertex deletion in updating minimum spanning trees
type: Item
instance of: scholarly article
title: On handling vertex deletion in updating minimum spanning trees
zbMATH Open document ID: 0646.68083
DOI: 10.1016/0020-0190(88)90020-8
author: Yung H. Tsin
published in: Information Processing Letters
publication date: 1988-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4055069
zbMATH Keywords: vertex deletion
zbMATH Keywords: updating of minimum spanning trees
zbMATH Keywords: parallel graph algorithm
zbMATH Keywords: incremental algorithm
zbMATH Keywords: parallel computation
MaRDI profile type: Publication
full work available at URL: 0020-0190(88)90020-8
OpenAlex ID: W1561849018
cites work: Algorithms for updating minimal spanning trees
cites work: Efficient parallel algorithms for some graph problems
cites work: An O(log n) algorithm for parallel update of minimum spanning trees
description: scientific article; zbMATH DE number 4055069