A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph

We present a randomized parallel algorithm with polylogarithmic expected running time for finding a maximal independent set in a linear hypergraph.

Bibliographic Details

Published in:	Journal of algorithms Vol. 25; no. 2; pp. 311 - 320
Main Authors:	Łuczak, Tomasz, Szymańska, Edyta
Format:	Journal Article
Language:	English
Published:	San Diego, CA Elsevier Inc 01.11.1997 Elsevier
Subjects:	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science; control theory; systems Exact sciences and technology Information retrieval. Graph Theoretical computing Hypergraph Independent set Maximal graph Polynomial algorithm Randomized algorithm Parallel algorithms
ISSN:	0196-6774, 1090-2678
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!