Ramsey numbers and an approximation algorithm for the vertex cover problem
暂无分享,去创建一个
[1] P. Erdös,et al. Graph Theory and Probability , 1959 .
[2] Burkhard Monien. The complexity of determining a shortest cycle of even length , 2005, Computing.
[3] A. Leaf. GRAPH THEORY AND PROBABILITY , 1957 .
[4] Reuven Bar-Yehuda,et al. On approximating a vertex cover for planar graphs , 1982, STOC '82.
[5] Ewald Speckenmeyer,et al. Some Further Approximation Algorithms for the Vertex Cover Problem , 1983, CAAP.
[6] Leslie E. Trotter,et al. Vertex packings: Structural properties and algorithms , 1975, Math. Program..
[7] Dorit S. Hochbaum,et al. Efficient bounds for the stable set, vertex cover and set packing problems , 1983, Discret. Appl. Math..
[8] Jerrold R. Griggs. Lower bounds on the independence number in terms of the degrees , 1983, J. Comb. Theory, Ser. B.
[9] D. Koenig. Theorie Der Endlichen Und Unendlichen Graphen , 1965 .
[10] János Komlós,et al. A Note on Ramsey Numbers , 1980, J. Comb. Theory, Ser. A.
[11] Shimon Even,et al. Graph Algorithms , 1979 .
[12] Jack E. Graver,et al. Some graph theoretic results associated with Ramsey's theorem* , 1968 .
[13] G. Hopkins,et al. Girth and Independence Ratio , 1982, Canadian Mathematical Bulletin.