Author:
Halldórsson M. M.,Radhakrishnan J.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference30 articles.
1. N. Alon, U. Feige, A. Wigderson, and D. Zuckerman. Derandomized graph products.Computational Complexity, 5 (1): 60–75, 1995.
2. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and hardness of approximation problems.Proc. 33rd Ann. IEEE Symp. on Foundations of Computer Science, pages 14–23, Oct. 1992.
3. LNCS;P. Berman,1995
4. P. Berman and M. Fürer. Approximating maximum independent set in bounded degree graphs.Proc. Fifth Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 365–371, Jan. 1994.
5. R. L. Brooks. On coloring the nodes of a network.Math. Proc. Cambridge Philos. Soc., 37: 194–197, 1991.
Cited by
156 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献