메뉴 건너뛰기




Volumn 7, Issue , 2001, Pages 178-181

A polyhedral approach for graph coloring

Author keywords

Facets of Polyhedra; Graph Coloring; Integer Programming

Indexed keywords


EID: 33644608965     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/s1571-0653(04)00254-9     Document Type: Article
Times cited : (21)

References (3)
  • 2
    • 0000942921 scopus 로고    scopus 로고
    • An improved algorithm for exact graph coloring
    • JOHNSON, D. and TRICK, M. eds.
    • Sewell, E. C., An improved algorithm for exact graph coloring, DIMACS, JOHNSON, D. and TRICK, M. eds. (1996).
    • (1996) DIMACS
    • Sewell, E.C.1
  • 3
    • 0001515729 scopus 로고    scopus 로고
    • A column generation approach for graph coloring
    • Mehrotra, A. and Trick, M., A column generation approach for graph coloring, INFORMS J. on Computing 8, No. 4 (1996) 344-353.
    • (1996) INFORMS J. on Computing , vol.8 , Issue.4 , pp. 344-353
    • Mehrotra, A.1    Trick, M.2


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