SCOPUS 정보 검색 플랫폼

Information Processing Letters

Volumn 80, Issue 5, 2001, Pages 249-256

Routing and path multicoloring

(3) Nomikos, Christos a Pagourtzis, Aris a,b,c Zachos, Stathis c

a UNIVERSITY OF IOANNINA (Greece)

b UNIVERSITY OF LIVERPOOL (United Kingdom)

c NATIONAL TECHNICAL UNIVERSITY OF ATHENS (Greece)

Author keywords

Algorithms; All optical networks; Parallel fiber links; Path coloring; Routing

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BANDWIDTH; COLOR IMAGE PROCESSING; EDGE DETECTION; GRAPH THEORY; MATHEMATICAL TRANSFORMATIONS; OPTICAL LINKS; PARALLEL PROCESSING SYSTEMS; ROUTERS;

PATH MULTICOLORING;

OPTICAL COMMUNICATION;

EID: 0035892392 PISSN: 00200190 EISSN: None Source Type: Journal
DOI: 10.1016/S0020-0190(01)00167-3 Document Type: Article

Times cited : (30)

References (15)

1
- 0000972677
- Optimal wavelength routing on directed fiber trees
- (1999) Theoret. Comput. Sci. , vol.221 , Issue.1-2 , pp. 119-137
- Erlebach, T.¹ Jansen, K.² Kaklamanis, C.³ Mihail, M.⁴ Persiano, P.⁵

2
- 0000175577
- On edge coloring bipartite graphs
- (1982) SIAM J. Comput. , vol.11 , Issue.3 , pp. 540-546
- Cole, R.¹ Hopcroft, J.E.²

3
- 0001189244
- The complexity of coloring circular arcs and chords
- (1980) SIAM J. Alg. Discrete Math. , vol.1 , Issue.2 , pp. 216-227
- Garey, M.¹ Johnson, D.² Miller, G.³ Papadimitriou, C.⁴

4
- 38249042614
- Better than best possible algorithm to edge color multigraphs
- (1986) J. Algorithms , vol.7 , Issue.1 , pp. 79-104
- Hochbaum, D.S.¹ Nishizeki, T.² Shmoys, D.B.³

5
- 0000429528
- The NP-completeness of edge coloring
- (1981) SIAM J. Comput. , vol.10 , pp. 718-720
- Holyer, I.¹

6
- 0000088569
- On the coloring of circular arc graphs
- (in Russian); English transl. D. Gamarnik, D. Williamson, N. Edwards
- (1980) Dokl. (Reports) Acad. Sci. Armen. , vol.70 , Issue.5 , pp. 306-311
- Karapetian, I.A.¹

7
- 0033890515
- On the wavelength assignment problem in multifiber WDM star and ring networks
- (2000) Proc. INFOCOM
- Li, G.¹ Simha, R.²

8
- 84974605117
- Wavelength assignment problem on all-optical networks with k fibres per link
- (2000) Proc. ICALP , pp. 768-779
- Margara, L.¹ Simon, J.²

9
- 0029547691
- Efficient access to optical bandwidth
- (1995) Proc. 36th Annual Symposium on Foundations of Computer Science (FOCS) , pp. 548-557
- Mihail, M.¹ Kaklamanis, C.² Rao, S.³

10
- 0004247105
- Ph.D. Thesis, Dept. of Electrical and Computer Engineering, NTUA Athens, Greece
- (1997) Path colorings in graphs
- Nomikos, C.¹

11
- 0004058166
- Routing and path coloring in rings: NP-completeness
- Technical Report 15-2000, University of Ioannina, Greece
- (2000)
- Nomikos, C.¹

12
- 0025791186
- An optimal greedy heuristic to color interval graphs
- (1991) Inform. Process. Lett. , vol.37 , pp. 21-25
- Olariu, S.¹

13
- 0028098406
- Efficient routing in all-optical networks
- (1994) Proc. 26th Annual ACM Symposium on the Theory of Computing (STOC) , pp. 134-143
- Raghavan, P.¹ Upfal, E.²

14
- 0032266933
- Bipartite edge coloring in O(Δm) time
- (1999) SIAM J. Comput. , vol.28 , Issue.3 , pp. 841-846
- Schrijver, A.¹

15
- 0000455611
- Decomposition by clique separators
- (1985) Discrete Math. , vol.55 , pp. 221-232
- Tarjan, R.¹

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