SCOPUS 정보 검색 플랫폼

Volumn 7, Issue , 2002, Pages

Finding the chromatic number by means of critical graphs

Author keywords

Algorithms; Experimentation; G.4 mathematical software : algorithm design and analysis; Performance

Indexed keywords

EID: 84940395577 PISSN: 10846654 EISSN: None Source Type: Journal
DOI: 10.1145/944618.944628 Document Type: Article

Times cited : (40)

References (12)

1
- 0018456690
- New Methods to Color the Vertices of a Graph
- Brélaz D., "New Methods to Color the Vertices of a Graph," Communications of the ACM 22, 4, 1979, 251-256.
- (1979) Communications of the ACM , vol.22 , Issue.4 , pp. 251-256
- Brélaz, D.¹

2
- 0000100195
- Chromatic Scheduling and the Chromatic Number Problem
- Brown J.R., "Chromatic Scheduling and the Chromatic Number Problem," Management Science 19, 4, 1972, 456-463.
- (1972) Management Science , vol.19 , Issue.4 , pp. 456-463
- Brown, J.R.¹

3
- 27844522089
- Genetic and Hybrid Algorithms for Graph Coloring
- Fleurent C. and Ferland J.A., "Genetic and Hybrid Algorithms for Graph Coloring," Annals of Operations Research 63, 1996, 437-461.
- (1996) Annals of Operations Research , vol.63 , pp. 437-461
- Fleurent, C.¹ Ferland, J.A.²

5
- 0003603813
- W.H. Freman and Company, New York
- Garey M.R. and Johnson D.S., Computers and Intractabilitiy : A Guide to the Theory of NP-Completeness. W.H. Freman and Company, New York, 1979
- (1979) Computers and Intractabilitiy: A Guide to the Theory of NP-Completeness
- Garey, M.R.¹ Johnson, D.S.²

6
- 0023596413
- Using Tabu Search for Graph Coloring
- Hertz A. and de Werra D., "Using Tabu Search for Graph Coloring," Computing 39, 1987, 345-351.
- (1987) Computing , vol.39 , pp. 345-351
- Hertz, A.¹ De Werra, D.²

7
- 0001047763
- Optimization by Simulated Annealing: An Experimental Evaluation. Part II, Graph Coloring and Number Partitioning
- Johnson D.S., Aragon C.R., McGeoch L.A. and Schevon C., "Optimization by Simulated Annealing: an Experimental Evaluation. Part II, Graph Coloring and Number Partitioning," Operations Research 39, 1991, 378-406.
- (1991) Operations Research , vol.39 , pp. 378-406
- Johnson, D.S.¹ Aragon, C.R.² McGeoch, L.A.³ Schevon, C.⁴

9
- 0020804873
- A Correction to Brélaz's Modification of Brown's Coloring Algorithm
- Peemöoller J., "A Correction to Brélaz's Modification of Brown's Coloring Algorithm," Communications of the ACM 26, 8, 1983, 593-597.
- (1983) Communications of the ACM , vol.26 , Issue.8 , pp. 593-597
- Peemöller, J.¹

10
- 0022041659
- A Generalized Implicit Enumeration Algorithm for Graph Coloring
- Kubale M. and Jackowski B., "A Generalized Implicit Enumeration Algorithm for Graph Coloring," Communications of the ACM 28, 4, 1985, 412-418.
- (1985) Communications of the ACM , vol.28 , Issue.4 , pp. 412-418
- Kubale, M.¹ Jackowski, B.²

11
- 0001515729
- A Column Generation Approach for Exact Graph Coloring
- Mehrotra A. and Trick M.A., "A Column Generation Approach for Exact Graph Coloring," INFORMS Journal on Computing 8, 1996, 344-354.
- (1996) INFORMS Journal on Computing , vol.8 , pp. 344-354
- Mehrotra, A.¹ Trick, M.A.²

12
- 0039191267
- Heuristics for Graph Coloring
- de Werra D., "Heuristics for Graph Coloring," Computing 7, 1990, 191-208.
- (1990) Computing , vol.7 , pp. 191-208
- De Werra, D.¹

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