SCOPUS 정보 검색 플랫폼

Volumn 3351, Issue , 2005, Pages 9-22

Minimum sum multicoloring on the edges of planar graphs and partial k-trees (Extended Abstract)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COLORING; DATA STRUCTURES; POLYNOMIALS; SET THEORY;

DISJOINT SETS; MULTICOLORING; PLANAR GRAPHS;

GRAPH THEORY;

EID: 23944470716 PISSN: 03029743 EISSN: None Source Type: Conference Proceeding
DOI: 10.1007/978-3-540-31833-0_3 Document Type: Conference Paper

Times cited : (3)

References (12)

1
- 0028255806
- Approximation algorithms for NP-complete problems on planar graphs
- B. S. Baker. Approximation algorithms for NP-complete problems on planar graphs. J. Assoc. Comput. Mach., 41(1):153-180, 1994.
- (1994) J. Assoc. Comput. Mach. , vol.41 , Issue.1 , pp. 153-180
- Baker, B.S.¹

2
- 0013152316
- Sum multicoloring of graphs
- A. Bar-Noy, M. M. Halldórsson, G. Kortsarz, R. Salman, and H. Shachnai. Sum multicoloring of graphs. J. Algorithms, 37(2):422-450, 2000.
- (2000) J. Algorithms , vol.37 , Issue.2 , pp. 422-450
- Bar-Noy, A.¹ Halldórsson, M.M.² Kortsarz, G.³ Salman, R.⁴ Shachnai, H.⁵

3
- 0002981945
- A partial k-arboretum of graphs with bounded treewidth
- H. L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci., 209(1-2):1-45, 1998.
- (1998) Theoret. Comput. Sci. , vol.209 , Issue.1-2 , pp. 1-45
- Bodlaender, H.L.¹

4
- 0022106463
- Scheduling file transfers
- E. G. Coffman, Jr., M. R. Garey, D. S. Johnson, and A. S. LaPaugh. Scheduling file transfers. SIAM J. Comput., 14(3):744-780, 1985.
- (1985) SIAM J. Comput. , vol.14 , Issue.3 , pp. 744-780
- Coffman Jr., E.G.¹ Garey, M.R.² Johnson, D.S.³ Lapaugh, A.S.⁴

5
- 0036488753
- Tools for multicoloring with applications to planar graphs and partial k-trees
- M. M. Halldórsson and G. Kortsarz. Tools for multicoloring with applications to planar graphs and partial k-trees. J. Algorithms, 42(2):334-366, 2002.
- (2002) J. Algorithms , vol.42 , Issue.2 , pp. 334-366
- Halldórsson, M.M.¹ Kortsarz, G.²

6
- 0037471702
- Multicoloring trees
- M. M. Halldórsson, G. Kortsarz, A. Proskurowski, R. Salman, H. Shachnai, and J. A. Telle. Multicoloring trees. Inform. and Comput., 180(2):113-129, 2003.
- (2003) Inform. and Comput. , vol.180 , Issue.2 , pp. 113-129
- Halldórsson, M.M.¹ Kortsarz, G.² Proskurowski, A.³ Salman, R.⁴ Shachnai, H.⁵ Telle, J.A.⁶

7
- 0000071158
- Complexity of scheduling multiprocessor tasks with prespecified processor allocations
- J. A. Hoogeveen, S. L. van de Velde, and B. Veltman. Complexity of scheduling multiprocessor tasks with prespecified processor allocations. Discrete Appl. Math., 55(3):259-272, 1994.
- (1994) Discrete Appl. Math. , vol.55 , Issue.3 , pp. 259-272
- Hoogeveen, J.A.¹ Van De Velde, S.L.² Veltman, B.³

8
- 0030295232
- Asymptotics of the chromatic index for multigraphs
- J. Kahn. Asymptotics of the chromatic index for multigraphs. J. Combin. Theory Ser. B, 68(2)-.233-254, 1996.
- (1996) J. Combin. Theory Ser. B , vol.68 , Issue.2 , pp. 233-254
- Kahn, J.¹

9
- 33745263318
- Manuscript
- D. Marx. Complexity results for minimum sum edge multicoloring. Manuscript.
- Complexity Results for Minimum Sum Edge Multicoloring
- Marx, D.¹

12
- 85171835916
- A theorem on coloring the lines of a network
- C. E. Shannon. A theorem on coloring the lines of a network. J. Math. Physics, 28:148-151, 1949.
- (1949) J. Math. Physics , vol.28 , pp. 148-151
- Shannon, C.E.¹

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