On Computing Maximal Independent Sets of Hypergraphs in Parallel
暂无分享,去创建一个
[1] Maxim Sviridenko,et al. Concentration and moment inequalities for polynomials of independent random variables , 2012, SODA.
[2] Tomasz Luczak,et al. A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph , 1997, J. Algorithms.
[3] Pierre Kelsen,et al. On the parallel complexity of computing a maximal independent set in a hypergraph , 1992, STOC '92.
[4] Aravind Srinivasan,et al. On Computing Maximal Independent Sets of Hypergraphs in Parallel , 2014, ACM Trans. Parallel Comput..
[5] B GibbonsPhillip. ACM transactions on parallel computing , 2014 .
[6] Aravind Srinivasan,et al. Finding Large Independent Sets in Graphs and Hypergraphs , 2005, SIAM J. Discret. Math..
[7] Paul Beame,et al. Parallel search for maximal independence given minimal dependence , 1990, SODA '90.
[8] Richard M. Karp,et al. Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[9] Van H. Vu,et al. Concentration of Multivariate Polynomials and Its Applications , 2000, Comb..
[10] Eli Upfal,et al. The Complexity of Parallel Search , 1988, J. Comput. Syst. Sci..
[11] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.