SCOPUS 정보 검색 플랫폼

Volumn 22, Issue 1, 1985, Pages 115-123

Ramsey numbers and an approximation algorithm for the vertex cover problem

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS;

APPROXIMATION ALGORITHM; RAMSEY NUMBERS; VERTEX COVER PROBLEM;

MATHEMATICAL TECHNIQUES;

EID: 0022045936 PISSN: 00015903 EISSN: 14320525 Source Type: Journal
DOI: 10.1007/BF00290149 Document Type: Article

Times cited : (138)

References (15)

2
- 84934658104
- Bar-Yehuda, R., Even, S.: On approximating a vertex cover for planar graphs. Proc. 14th Ann. ACM Symp. Th. Computing, pp. 303–309. San Francisco 1982

3
- 84934658103
- Bar-Yehuda, R, Even, S.: A 2−log log n/2log n performance ratio for the weighted vertex cover problem. Technion Haifa, Technical Report #260, January 1983

4
- 0001869610
- Graph theory and probability
- (1959) Canadian Journal of Mathematics , vol.11 , pp. 34-38
- Erdös, P.¹

5
- 84934658348
- Erdös, P., Gallai, T.: On the minimal number of vertices representing the edges of a graph, pp. 181–203. Magyar Tudományos Akadémia Matematikai Kutato Intézetének Közleményei VI. Evfolyam 1961

6
- 0004201430
- Computer Science Press, Rockville, MD
- (1979) Graph algorithms
- Even, S.¹

7
- 84934658349
- Fajtlowicz, S.: On the size of independent sets in graphs. In: Proc. 9th S.E. Conf. Combinatorics, Graph Theory and Computing, Boca Raton, Congressum Numerantium No. XXI, pp. 269–274. Utilitas Mathematical-Publ. Inc. 1978

8
- 0010778447
- Some graph theoretic results with Ramsey's theorem
- (1968) J. Comb. Theory, Ser. A , vol.4 , pp. 125-175
- Graver, J.E¹ Yackel, J.²

9
- 0042167079
- Lower bounds on the independence number in terms of the degrees
- (1983) J. Comb. Theory, Ser. B , vol.34 , pp. 22-39
- Griggs, J.R.¹

10
- 0020822226
- Efficient bounds for the stable set, vertex cover and set packing problems
- (1983) Discrete Appl. Math. , vol.6 , pp. 243-254
- Hochbaum, D.S.¹

11
- 3342943967
- Girth and independence ratio
- (1982) Canadian Mathematical Bulletin , vol.25 , pp. 179-186
- Hopkins, G.¹ Staton, W.²

12
- 0003858645
- Akademische Verlagsgesellschaft, Leipzig
- (1936) Theorie der endlichen und unendlichen Graphen
- König, D.¹

13
- 0020876638
- The complexity of determining a shortest cycle of even length
- (1983) Computing , vol.31 , pp. 355-369
- Monien, B.¹

15
- 34250404286
- Vertex packing: structural properties and algorithms
- (1975) Math. Program. , vol.8 , pp. 232-248
- Nemhauser, G.L.¹ Trotter, L.E.²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.