Parallel Graph Coloring.
暂无分享,去创建一个
[1] Dorit S. Hochbaum,et al. Approximation Algorithms for NP-Hard Problems , 1996 .
[2] Joseph JáJá,et al. An Introduction to Parallel Algorithms , 1992 .
[3] Fredrik Manne. A Parallel Algorithm for Computing the Extremal Eigenvalues of Very Large Sparse Matrices , 1998, PARA.
[4] Michael Sipser,et al. Introduction to the Theory of Computation , 1996, SIGA.
[5] Tommy R. Jensen,et al. Graph Coloring Problems , 1994 .
[6] Zbigniew J. Czech,et al. Introduction to Parallel Computing , 2017 .
[7] Michael Luby. A Simple Parallel Algorithm for the Maximal Independent Set Problem , 1986, SIAM J. Comput..
[8] A. Gamst,et al. Some lower bounds for a class of frequency assignment problems , 1986, IEEE Transactions on Vehicular Technology.
[9] Magnús M. Hallórsson. A still better performance guarantee for approximate graph coloring , 1993 .
[10] Mark T. Jones,et al. A Parallel Graph Coloring Heuristic , 1993, SIAM J. Sci. Comput..
[11] Vipin Kumar,et al. Analysis of Multilevel Graph Partitioning , 1995, Proceedings of the IEEE/ACM SC95 Conference.
[12] Gary Lewandowski. Practical implementations and applications of graph coloring , 1995 .
[13] C. Reeves. Modern heuristic techniques for combinatorial problems , 1993 .
[14] Mihir Bellare,et al. Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..
[15] John Cocke,et al. A methodology for the real world , 1981 .
[16] J. J. Moré,et al. Estimation of sparse jacobian matrices and graph coloring problems , 1983 .
[17] Daniel Brélaz,et al. New methods to color the vertices of a graph , 1979, CACM.
[18] Michael Randolph Garey,et al. An Application of Graph Coloring to Printed Circuit Testing (Working Paper) , 1975, FOCS 1975.
[19] Mihir Bellare,et al. Free bits, PCPs and non-approximability-towards tight results , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[20] Magnús M. Halldórsson. Frugal Methods for the Independent Set and Graph Coloring Problems. , 1991 .