A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity
type: Item
instance of: scholarly article
title: A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity
zbMATH Open document ID: 0900.68237
DOI: 10.1016/0020-0190(96)00040-3
author: Oscar Garrido
author: Pierre Kelsen
author: Andrzej Lingas
published in: Information Processing Letters
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 983932
zbMATH Keywords: Maximal independent set
zbMATH Keywords: Hypergraph
zbMATH Keywords: Parallel algorithms
MaRDI profile type: Publication
full work available at URL: 0020-0190(96)00040-3
OpenAlex ID: W2069194665
cites work: Q4099676
cites work: An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3
cites work: Parallel Symmetry-Breaking in Sparse Graphs
cites work: Constructing a Maximal Independent Set in Parallel
cites work: Q4385522
cites work: The complexity of parallel search
cites work: A fast parallel algorithm for the maximal independent set problem
cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem
cites work: Removing randomness in parallel computation without a processor penalty
description: scientific article; zbMATH DE number 983932