论文信息 - Implementing Luby’s Algorithm on the CRAY T3E - 字舞流文

Implementing Luby’s Algorithm on the CRAY T3E

We present an implementation of Luby’s algorithm for the calculation of maximal independent sets in graphs on the Cray T3E.

Markus Lohrey | Jürgen Gross | Markus Lohrey | J. Groß

[1] Dexter Kozen,et al. The Design and Analysis of Algorithms , 1991, Texts and Monographs in Computer Science.

[2] G. Rodrigue. Parallel Computations , 1982 .

[3] Michael Luby. A Simple Parallel Algorithm for the Maximal Independent Set Problem , 1986, SIAM J. Comput..

[4] José D. P. Rolim,et al. A new general derandomization method , 1998, JACM.

[5] Richard M. Karp,et al. A fast parallel algorithm for the maximal independent set problem , 1985, JACM.

[6] David G. Kirkpatrick,et al. Optimal Search in Planar Subdivisions , 1983, SIAM J. Comput..

[7] Paul G. Spirakis,et al. Fast Parallel Approximations of hte Maximum Weighted Cut Problem through Derandomization , 1989, FSTTCS.

[8] Michael T. Goodrich,et al. Bounded-Independence Derandomization of Geometric Partitioning with Applications to Parallel Fixed-Dimensional Linear Programming , 1997, Discret. Comput. Geom..

[9] Richard J. Lipton,et al. A Batching Method for Coloring Planar Graphs , 1978, Information Processing Letters.

[10] Noga Alon,et al. A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.

[11] Marek Chrobak,et al. Fast Algorithms for Edge-Coloring Planar Graphs , 1989, J. Algorithms.

[12] Oded Goldreich,et al. On the power of two-point based sampling , 1989, J. Complex..