{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T20:25:52Z","timestamp":1664655952139},"reference-count":11,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J CIRCUIT SYST COMP"],"published-print":{"date-parts":[[2004,4]]},"abstract":"<jats:p> Multihop wireless networks consist of mobile terminals with personal communication devices. Each terminal can receive a message and then send it to another terminal. In these networks, it is important to assign channels for communications to each terminal efficiently. There are some studies on this assignment problem using a conventional edge coloring in graph theory. In this paper, we propose a new edge coloring problem in graph and network theory on this assignment problem and we discuss the computational complexity of the problem. This edge coloring problem takes the degree of interference into consideration. Therefore, we can reuse the channels more efficiently compared with the conventional method. <\/jats:p>","DOI":"10.1142\/s0218126604001398","type":"journal-article","created":{"date-parts":[[2004,6,25]],"date-time":"2004-06-25T10:43:52Z","timestamp":1088160232000},"page":"375-385","source":"Crossref","is-referenced-by-count":5,"title":["A CHANNEL ASSIGNMENT PROBLEM IN MULTIHOP WIRELESS NETWORKS AND GRAPH THEORY"],"prefix":"10.1142","volume":"13","author":[{"given":"HIROSHI","family":"TAMURA","sequence":"first","affiliation":[{"name":"Niigata Institute of Technology, Kashiwazaki-shi, 945-1195, Japan"}]},{"given":"KAORU","family":"WATANABE","sequence":"additional","affiliation":[{"name":"Osaka Electro-Communication University, Neyagawa-shi, 572-8530, Japan"}]},{"given":"MASAKAZU","family":"SENGOKU","sequence":"additional","affiliation":[{"name":"Faculty of Engineering, Niigata University, Niigata-shi, 950-2181, Japan"}]},{"given":"SHOJI","family":"SHINODA","sequence":"additional","affiliation":[{"name":"Faculty of Science and Engineering, Chuo University, Tokyo, 112-8551, Japan"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","first-page":"1117","volume":"77","author":"Sengoku M.","journal-title":"IEICE Trans. Fundamentals"},{"key":"rf2","first-page":"98","volume":"84","author":"Mase K.","journal-title":"IEICE Trans. Fundamentals"},{"key":"rf3","first-page":"205","volume":"29","author":"Faudree R. J.","journal-title":"Ars Combinatoria B"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00237-2"},{"key":"rf5","volume-title":"Graphs and Digraphs","author":"Behzad M.","year":"1979"},{"key":"rf6","volume-title":"Graphs","author":"Berge C.","year":"1985"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)90275-F"},{"key":"rf8","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1109\/T-VT.1987.24118","volume":"36","author":"Lee W. C. Y.","journal-title":"IEEE Trans. Vehicular Technol."},{"key":"rf9","first-page":"44","author":"Lee W. C. Y.","journal-title":"Telephony"},{"key":"rf10","first-page":"2123","volume":"84","author":"Suda K.","journal-title":"IEICE Trans. Communications"},{"key":"rf11","volume-title":"Computers and Intractability","author":"Garay M. R.","year":"1979"}],"container-title":["Journal of Circuits, Systems and Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218126604001398","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T03:43:01Z","timestamp":1565149381000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218126604001398"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4]]},"references-count":11,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2004,4]]}},"alternative-id":["10.1142\/S0218126604001398"],"URL":"https:\/\/doi.org\/10.1142\/s0218126604001398","relation":{},"ISSN":["0218-1266","1793-6454"],"issn-type":[{"value":"0218-1266","type":"print"},{"value":"1793-6454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,4]]}}}