A Parallel Maximal Independent Set Algorithm
暂无分享,去创建一个
[1] Daniel Brélaz,et al. New methods to color the vertices of a graph , 1979, CACM.
[2] Michael Luby,et al. A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.
[3] Richard Cole,et al. Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking , 2018, Inf. Control..
[4] Andrew V. Goldberg,et al. Parallel symmetry-breaking in sparse graphs , 1987, STOC.
[5] Mark T. Jones,et al. A Parallel Graph Coloring Heuristic , 1993, SIAM J. Sci. Comput..
[6] Gary L. Miller,et al. Geometric mesh partitioning: implementation and experiments , 1995, Proceedings of 9th International Parallel Processing Symposium.
[7] Vipin Kumar,et al. Parallel Multilevel k-way Partitioning Scheme for Irregular Graphs , 1996, Proceedings of the 1996 ACM/IEEE Conference on Supercomputing.
[8] M. Adams. Heuristics for the Automatic Construction of Coarse Grids in Multigrid Solvers for Finite Element Matrices , 1998 .
[9] William Gropp,et al. PETSc 2.0 users manual , 2000 .