首页 | 本学科首页   官方微博 | 高级检索  
     检索      


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 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号