SCOPUS 정보 검색 플랫폼

Volumn 105, Issue , 1998, Pages 93-104

On-line coloring k-colorable graphs

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0010777434 PISSN: 00212172 EISSN: None Source Type: Journal
DOI: 10.1007/BF02780324 Document Type: Article

Times cited : (26)

References (7)

1
- 0028425392
- New approximation algorithms for graph coloring
- A. Blum, New approximation algorithms for graph coloring, Journal of the Association for Computing Machinery 31 (1994), 470-516.
- (1994) Journal of the Association for Computing Machinery , vol.31 , pp. 470-516
- Blum, A.¹

2
- 0040697949
- preprint
- 3/14)-coloring for 3-colorable graphs, preprint.
- 3/14)-coloring for 3-colorable Graphs
- Blum, A.¹ Karger, D.²

4
- 0003686156
- Akadémiai Kiadó, Budapest
- L. Lovász, Combinatorial Problems and Exercises, Akadémiai Kiadó, Budapest, 1993.
- (1993) Combinatorial Problems and Exercises
- Lovász, L.¹

5
- 0001320277
- An online graph coloring algorithm with sublinear performance ratio
- L. Lovász, M. Saks and W.T. Trotter, An online graph coloring algorithm with sublinear performance ratio, Discrete Mathematics 75 (1989), 319-325.
- (1989) Discrete Mathematics , vol.75 , pp. 319-325
- Lovász, L.¹ Saks, M.² Trotter, W.T.³

6
- 0039512747
- private communication
- M. Szegedy, private communication (1986).
- (1986)
- Szegedy, M.¹

7
- 38249009791
- Randomized online graph coloring
- S. Vishwanathan, Randomized online graph coloring, Journal of Algorithms 13 (1992), 657-669.
- (1992) Journal of Algorithms , vol.13 , pp. 657-669
- Vishwanathan, S.¹

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