Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees
type: Item
instance of: scholarly article
title: Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees
zbMATH Open document ID: 0637.68046
DOI: 10.1016/0020-0190(88)90084-1
author: Hermann Jung
author: K. Mehlhorn
published in: Information Processing Letters
publication date: 1988-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 4039289
zbMATH Keywords: parallel algorithm
zbMATH Keywords: independent sets in trees
zbMATH Keywords: minimum spanning trees
MaRDI profile type: Publication
full work available at URL: 0020-0190(88)90084-1
OpenAlex ID: W2065634943
cites work: Deterministic coin tossing with applications to optimal parallel list ranking
cites work: Faster optimal parallel prefix sums and list ranking
cites work: An Efficient Parallel Biconnectivity Algorithm
cites work: Q3725547
Recommended article: Optimal parallel algorithms for multiple updates of minimum spanning trees
Recommended article: A Parallel Algorithm for Computing Minimum Spanning Trees
Recommended article: An efficient parallel algorithm for updating minimum spanning trees
Recommended article: Q3982549
Recommended article: Q4526020
Recommended article: Minimal spanning trees: An empirical investigation of parallel algorithms
Recommended article: Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees
Recommended article: A New Parallel Algorithm for the Maximal Independent Set Problem
description: scientific article; zbMATH DE number 4039289