An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3
type: Item
instance of: scholarly article
title: An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3
zbMATH Open document ID: 0764.68048
DOI: 10.1016/0020-0190(92)90228-N
author: Elias Dahlhaus
author: Marek Karpinski
author: Pierre Kelsen
published in: Information Processing Letters
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 92136
zbMATH Keywords: parallel algorithms
zbMATH Keywords: computational complexity
zbMATH Keywords: maximal independent set
zbMATH Keywords: hypergraph
zbMATH Keywords: NC algorithm
MaRDI profile type: Publication
cites work: A fast and simple randomized parallel algorithm for the maximal independent set problem
cites work: Q3138895
cites work: A New Parallel Algorithm for the Maximal Independent Set Problem
cites work: Constructing a Maximal Independent Set in Parallel
cites work: Q4385522
cites work: The complexity of parallel search
cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem
description: scientific article; zbMATH DE number 92136