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.

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of algorithms Ročník 25; číslo 2; s. 311 - 320
Hlavní autoři:	Łuczak, Tomasz, Szymańska, Edyta
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	San Diego, CA Elsevier Inc 01.11.1997 Elsevier
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	We present a randomized parallel algorithm with polylogarithmic expected running time for finding a maximal independent set in a linear hypergraph.
ISSN:	0196-6774 1090-2678
DOI:	10.1006/jagm.1997.0884