An O(log n) algorithm for parallel update of minimum spanning trees
type: Item
instance of: scholarly article
title: An O(log n) algorithm for parallel update of minimum spanning trees
zbMATH Open document ID: 0592.68061
DOI: 10.1016/0020-0190(86)90098-0
author: I. V. Ramakrishnan
author: Shaunak R. Pawagi
published in: Information Processing Letters
publication date: 1986-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 3952027
zbMATH Keywords: graph algorithm
MaRDI profile type: Publication
full work available at URL: 0020-0190(86)90098-0
OpenAlex ID: W2080566336
cites work: Algorithms for updating minimal spanning trees
cites work: Fast, Efficient Parallel Algorithms for Some Graph Problems
cites work: On Finding and Updating Spanning Trees and Shortest Paths
cites work: Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
cites work: Implementation of simultaneous memory address access in models that forbid it
description: scientific article; zbMATH DE number 3952027