SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Discrete Applied Mathematics

Volumn 118, Issue 3, 2002, Pages 239-248

On the computational complexity of strong edge coloring

(1) Mahdian, Mohammad a

a MASSACHUSETTS INSTITUTE OF TECHNOLOGY (United States)

Author keywords

Antimatching; Induced matching; NP completeness; Strong edge coloring

Indexed keywords

EID: 84867930488 PISSN: 0166218X EISSN: None Source Type: Journal
DOI: 10.1016/S0166-218X(01)00237-2 Document Type: Article

Times cited : (60)

References (15)

1
- 0038199352
- Graphs and interconnection networks: Diameter and vulnerability
- ed., E. Keith Lloyd, Cambridge Univ. Press, Cambridge, New York
- J.C. Bermond, J. Bond, M. Paoli, C. Peyrat, Graphs and interconnection networks: diameter and vulnerability, in: Surveys in Combinatorics (Southampton), London Mathematical Society Lecture Note Series, Vol. 82, ed., E. Keith Lloyd, Cambridge Univ. Press, Cambridge, New York, 1983, pp. 1-30.
- (1983) Surveys in Combinatorics (Southampton), London Mathematical Society Lecture Note Series , vol.82 , pp. 1-30
- Bermond, J.C.¹ Bond, J.² Paoli, M.³ Peyrat, C.⁴

2
- 38249026369
- Induced matchings
- K. Cameron Induced matchings Discrete Appl. Math. 24 1989 97 102
- (1989) Discrete Appl. Math. , vol.24 , pp. 97-102
- Cameron, K.¹

3
- 38249016625
- 2-free graphs of bounded degree
- 2-free graphs of bounded degree Discrete Math. 81 1990 129 135
- (1990) Discrete Math. , vol.81 , pp. 129-135
- Chung, F.R.K.¹ Gyárfás, A.² Tuza, Zs.³ Trotter, W.T.⁴

4
- 38249026693
- Induced matchings in bipartite graphs
- R.J. Faudree, A. Gyárfás, R.H. Schelp, and Zs. Tuza Induced matchings in bipartite graphs Discrete Math. 78 1989 83 87
- (1989) Discrete Math. , vol.78 , pp. 83-87
- Faudree, R.J.¹ Gyárfás, A.² Schelp, R.H.³ Tuza, Zs.⁴

5
- 0001473987
- The strong chromatic index of graphs
- R.J. Faudree, A. Gyárfás, R.H. Schelp, and Zs. Tuza The strong chromatic index of graphs Ars Combin. 29B 1990 205 211
- (1990) Ars Combin. , vol.29 B , pp. 205-211
- Faudree, R.J.¹ Gyárfás, A.² Schelp, R.H.³ Tuza, Zs.⁴

6
- 0003603813
- W.H. Freeman and Company San Francisco
- M.R. Garey, and D.S. Johnson Computers and Intractability, A Guide to the Theory of NP-Completeness 1979 W.H. Freeman and Company San Francisco
- (1979) Computers and Intractability, A Guide to the Theory of NP-Completeness
- Garey, M.R.¹ Johnson, D.S.²

7
- 0003947606
- Academic Press New York
- M.C. Golumbic Algorithmic Graph Theory and Perfect Graphs 1980 Academic Press New York
- (1980) Algorithmic Graph Theory and Perfect Graphs
- Golumbic, M.C.¹

8
- 38249000134
- Irredundancy in circular arc graphs
- M.C. Golumbic, and R.C. Laskar Irredundancy in circular arc graphs Discrete Appl. Math. 44 1993 79 89
- (1993) Discrete Appl. Math. , vol.44 , pp. 79-89
- Golumbic, M.C.¹ Laskar, R.C.²

9
- 0000369268
- New results on induced matchings
- M.C. Golumbic, and M. Lewenstein New results on induced matchings Discrete Appl. Math. 101 2000 157 165
- (2000) Discrete Appl. Math. , vol.101 , pp. 157-165
- Golumbic, M.C.¹ Lewenstein, M.²

10
- 23544462435
- Working Paper, London School of Economics Operations Research, LSEOR 94.14, July
- C.W. Ko, F.B. Shepherd, Adding an identity to a totally unimodular matrix, Working Paper, London School of Economics Operations Research, LSEOR 94.14, July 1994.
- (1994) Adding An Identity to A Totally Unimodular Matrix
- Ko, C.W.¹ Shepherd, F.B.²

11
- 84958964595
- Approximating circular arc colouring and bandwidth allocation in all-optical ring networks
- Approximation Algorithms for Combinatorial Optimization
- V. Kumar, Approximating Circular arc Coloring and Bandwidth Allocation in all-optical Ring Networks, Lecture Notes in Computer Science, Vol. 1444, Springer, Berlin, 1998, pp. 147-158. (Pubitemid 128104537)
- (1998) Lecture Notes In Computer Science , Issue.1444 , pp. 147-158
- Kumar, V.¹

12
- 0034359367
- 4-free graphs
- 4-free graphs Random Structures Algorithms 17 2000 357 375
- (2000) Random Structures Algorithms , vol.17 , pp. 357-375
- Mahdian, M.¹

13
- 4344625627
- M.Sc. Thesis, Department of Computer Science, University of Toronto
- M. Mahdian, The strong chromatic index of graphs, M.Sc. Thesis, Department of Computer Science, University of Toronto, 2000.
- (2000) The Strong Chromatic Index of Graphs
- Mahdian, M.¹

14
- 0020765471
- Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
- S.T. McCormick Optimal approximation of sparse Hessians and its equivalence to a graph coloring problem Math. Programming 26 1983 153 171 (Pubitemid 13587149)
- (1983) Mathematical Programming , vol.26 , Issue.2 , pp. 153-171
- McCormick S.Thomas¹

15
- 0029754883
- A new model for scheduling packet radio networks
- A. Sen, M. Huson, A new model for scheduling packet radio networks, Proceedings of IEEE INFOCOM'96, Vol. 3, pp. 1116-1124.
- Proceedings of IEEE INFOCOM'96 , vol.3 , pp. 1116-1124
- Sen, A.¹ Huson, M.²

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