Proceedings of the IEEK Conference (대한전자공학회:학술대회논문집)
- 2002.07c
- /
- Pages.1375-1377
- /
- 2002
A New Total Coloring Problem in Multi-hop Networks
- Watanabe, K. (Osaka Electro-Communication University, Neyagawa-Shi) ;
- Sengoku, M. (Niigata University) ;
- Tamura, H. (Niigata Institute of Technology) ;
- Nakano, K. (Niigata University) ;
- Shinoda, S. (Chuo University)
- Published : 2002.07.01
Abstract
New graph coloring problems are discussed as models of a multihop network in this report. We consider a total scheduling problem, and prove that this problem is NP-hard. We propose new scheduling models of a multi-hop network for CDMA system, and show the complexity results of the scheduling problems.
Keywords