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.

Podrobná bibliografia

Vydané v:	Journal of algorithms Ročník 25; číslo 2; s. 311 - 320
Hlavní autori:	Łuczak, Tomasz, Szymańska, Edyta
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	San Diego, CA Elsevier Inc 01.11.1997 Elsevier
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!