메뉴 건너뛰기





Volumn , Issue , 1999, Pages 225-230

Graph coloring algorithms for fast evaluation of Curtis decompositions

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; HEURISTIC METHODS; INTEGRATED CIRCUIT LAYOUT; PROBLEM SOLVING; THEOREM PROVING;

EID: 0032681033     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/309847.309918     Document Type: Conference Paper
Times cited : (8)

References (25)
  • Reference 정보가 존재하지 않습니다.

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