A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph |
| |
Authors: | Tomasz ?uczak Edyta Szymańska |
| |
Institution: | Department of Discrete Mathematics, Adam Mickiewicz University, Poznań, Poland |
| |
Abstract: | We present a randomized parallel algorithm with polylogarithmic expected running time for finding a maximal independent set in a linear hypergraph. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |