메뉴 건너뛰기
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumn 1203, Issue , 1997, Pages 25-36
The optimum cost chromatic partition problem
Author keywords

[No Author keywords available]
Indexed keywords

COMPUTATIONAL COMPLEXITY; COSTS; OPTIMIZATION;
EID: 84957636464     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62592-5_58     Document Type: Conference Paper
Times cited : (44)
References (11)
  • 1
    • 0021787868 scopus 로고
    • Efficient algorithms for combinatorial problems on graphs with bounded decomposability-a survey
    • Arnborg, S.: Efficient algorithms for combinatorial problems on graphs with bounded decomposability-a survey. BIT 25 (1985) 2-23
    • (1985) BIT , vol.25 , pp. 2-23
    • Arnborg, S.1
  • 2
    • 0027242831 scopus 로고
    • A linear time algorithm for finding tree-decompositions of small treewidth
    • Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. 25.th ACM Symposium on the Theory of Computing (1993) 226-234
    • (1993) 25.th ACM Symposium on the Theory of Computing , pp. 226-234
    • Bodlaender, H.L.1
  • 3
    • 85029584335 scopus 로고
    • Scheduling with incompatible jobs. Graph Theoretic Concepts in Computer Science
    • Bodlaender, H.L., Jansen, K., Woeginger, G.: Scheduling with incompatible jobs. Graph Theoretic Concepts in Computer Science, LNCS 657 (1992) 37-49
    • (1992) LNCS , vol.657 , pp. 37-49
    • Bodlaender, H.L.1    Jansen, K.2    Woeginger, G.3
  • 4
    • 0002716241 scopus 로고
    • On certain polytopes associated with graphs
    • Chvatal, V.: On certain polytopes associated with graphs. Journal Combinatorial Theory B-18 (1975) 138-154
    • (1975) Journal Combinatorial Theory , vol.B-18 , pp. 138-154
    • Chvatal, V.1
  • 5
    • 0030536472 scopus 로고    scopus 로고
    • Precoloring extension. III. Classes of perfect graphs. Combinatorics
    • Hujter, M., Tuza, Z.: Precoloring extension. III. Classes of perfect graphs. Combinatorics, Probability and Computing 5 (1996) 35-56
    • (1996) Probability and Computing , vol.5 , pp. 35-56
    • Hujter, M.1    Tuza, Z.2
  • 6
    • 0041532168 scopus 로고
    • Ph. D. Thesis, Utrecht University, The Netherlands
    • Kloks, T.: Treewidth. Ph. D. Thesis, Utrecht University, The Netherlands (1991)
    • (1991) Treewidth
    • Kloks, T.1
  • 8
    • 0000673493 scopus 로고
    • Graph minors. II. Algorithmic aspects of treewidth
    • Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic aspects of treewidth. Journal on Algorithms 7 (1986) 309-322
    • (1986) Journal on Algorithms , vol.7 , pp. 309-322
    • Robertson, N.1    Seymour, P.D.2
  • 9
    • 0008523779 scopus 로고
    • On a graph partition problem with an application to VLSI layout
    • Sen, A., Deng, H., Gulia, S.: On a graph partition problem with an application to VLSI layout. Information Processing Letters 43 (1992) 87-94
    • (1992) Information Processing Letters , vol.43 , pp. 87-94
    • Sen, A.1    Deng, H.2    Gulia, S.3
  • 10
    • 0023108702 scopus 로고
    • Finding a maximum planar subset of a set of nets in a channel
    • Supowit, K.J.: Finding a maximum planar subset of a set of nets in a channel. IEEE Transactions on Computer Aided Design CAD 6, 1 (1987) 93-94
    • (1987) IEEE Transactions on Computer Aided Design CAD , vol.6 , Issue.1 , pp. 93-94
    • Supowit, K.J.1

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