{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:50:30Z","timestamp":1725558630095},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540202165"},{"type":"electronic","value":"9783540452089"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45208-9_13","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T00:49:20Z","timestamp":1277686160000},"page":"150-162","source":"Crossref","is-referenced-by-count":2,"title":["Channel Assignment in Honeycomb Networks"],"prefix":"10.1007","author":[{"given":"Alan A.","family":"Bertossi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cristina M.","family":"Pinotti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Romea","family":"Rizzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anil M.","family":"Shende","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"1314","DOI":"10.1006\/jpdc.2002.1860","volume":"62","author":"A.A. Bertossi","year":"2002","unstructured":"Bertossi, A.A., Pinotti, M.C.: Mappings for Conflict-Free Access of Paths in Bidimensional Arrays, Circular Lists, and Complete Trees. Journal of Parallel and Distributed Computing\u00a062, 1314\u20131333 (2002)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"13_CR2","unstructured":"Bertossi, A.A., Pinotti, M.C., Rizzi, R.: Channel Assignment on Strongly- Simplicial Graphs. In: 3rd Int\u2019l Workshop on Wireless, Mobile and Ad Hoc Networks, Nice (April 2003)"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Bertossi, A.A., Pinotti, M.C., Tan, R.B.: Channel Assignment with Separation for Interference Avoidance in Wireless Networks. IEEE Transactions on Parallel and Distributed Systems (February 2003) (to appear)","DOI":"10.1109\/TPDS.2003.1189581"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/3-540-46541-3_33","volume-title":"STACS 2000","author":"H.L. Bodlaender","year":"2000","unstructured":"Bodlaender, H.L., Kloks, T., Tan, R.B., van Leeuwen, J.: Approximation \u03bb- Coloring on Graphs. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol.\u00a01770, p. 395. Springer, Heidelberg (2000)"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1137\/S0895480193245339","volume":"9","author":"G.J. Chang","year":"1996","unstructured":"Chang, G.J., Kuo, D.: The L(2, 1)-Labeling Problem on Graphs. SIAM Journal on Discrete Mathematics\u00a09, 309\u2013316 (1996)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1109\/TC.1987.1676965","volume":"36","author":"I. Chlamtac","year":"1987","unstructured":"Chlamtac, I., Pinter, S.S.: Distributed Nodes Organizations Algorithm for Channel Access in a Multihop Dynamic Radio Network. IEEE Transactions on Computers\u00a036, 728\u2013737 (1987)","journal-title":"IEEE Transactions on Computers"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"J.R. Griggs","year":"1992","unstructured":"Griggs, J.R., Yeh, R.K.: Labelling Graphs with a Condition at Distance 2. SIAM Journal on Discrete Mathematics\u00a05, 586\u2013595 (1992)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"W.K. Hale","year":"1980","unstructured":"Hale, W.K.: Frequency Assignment: Theory and Application. Proceedings of the IEEE\u00a068, 1497\u20131514 (1980)","journal-title":"Proceedings of the IEEE"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Katzela, I., Naghshineh, M.: Channel Assignment Schemes for Cellular Mobile Telecommunication Systems: A Comprehensive Survey. IEEE Personal Communications, 10\u201331 (June 1996)","DOI":"10.1109\/98.511762"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF02592052","volume":"26","author":"S.T. McCormick","year":"1983","unstructured":"McCormick, S.T.: Optimal Approximation of Sparse Hessians and its Equivalence to a Graph Coloring Problem. Mathematical Programming\u00a026, 153\u2013171 (1983)","journal-title":"Mathematical Programming"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1137\/S0895480191223178","volume":"7","author":"D. Sakai","year":"1994","unstructured":"Sakai, D.: Labeling Chordal Graphs: Distance Two Condition. SIAM Journal on Discrete Mathematics\u00a07, 133\u2013140 (1994)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"13_CR12","unstructured":"Sen, A., Roxborough, T., Medidi, S.: Upper and Lower Bounds of a Class of Channel Assignment Problems in Cellular Networks, Technical Report, Arizona State University (1997)"},{"key":"13_CR13","unstructured":"Shende, A.M., et al.: A Characterisation of Optimal Channel Assignments for Wireless Networks Modelled as Cellular and Square Grids. In: 3rd Int\u2019l IEEE Workshop on Wireless, Mobile and Ad Hoc Networks, Nice (April 2003)"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1109\/71.629486","volume":"8","author":"I. Stojmenovic","year":"1997","unstructured":"Stojmenovic, I.: Honeycomb Networks: Topological Properties and Communication Algorithms. IEEE Transactions on Parallel and Distributed Systems\u00a08, 1036\u20131042 (1997)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1002\/(SICI)1097-0118(199812)29:4<263::AID-JGT5>3.0.CO;2-V","volume":"29","author":"J. Heuvel Van den","year":"1998","unstructured":"Van den Heuvel, J., Leese, R.A., Shepherd, M.A.: Graph Labelling and Radio Channel Assignment. Journal of Graph Theory\u00a029, 263\u2013283 (1998)","journal-title":"Journal of Graph Theory"},{"key":"13_CR16","unstructured":"Zander, J.: Trends and Challenges in Resource Management Future Wireless Networks. In: IEEE Wireless Communications & Networks Conference (2000)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45208-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T00:34:16Z","timestamp":1552610056000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45208-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540202165","9783540452089"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45208-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}