Łuczak, T., & Szymańska, E. (1997). A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph. Journal of algorithms, 25(2), 311-320. https://doi.org/10.1006/jagm.1997.0884
Chicago Style (17th ed.) CitationŁuczak, Tomasz, and Edyta Szymańska. "A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph." Journal of Algorithms 25, no. 2 (1997): 311-320. https://doi.org/10.1006/jagm.1997.0884.
MLA (9th ed.) CitationŁuczak, Tomasz, and Edyta Szymańska. "A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph." Journal of Algorithms, vol. 25, no. 2, 1997, pp. 311-320, https://doi.org/10.1006/jagm.1997.0884.
Warning: These citations may not always be 100% accurate.