{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:10:39Z","timestamp":1725541839953},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114083"},{"type":"electronic","value":"9783642114090"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11409-0_18","type":"book-chapter","created":{"date-parts":[[2009,12,3]],"date-time":"2009-12-03T13:12:27Z","timestamp":1259845947000},"page":"202-213","source":"Crossref","is-referenced-by-count":2,"title":["Local Algorithms for Edge Colorings in UDGs"],"prefix":"10.1007","author":[{"given":"Iyad A.","family":"Kanj","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Wiese","sequence":"additional","affiliation":[]},{"given":"Fenghui","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Barrett, C., Kumar, V., Marathe, M., Thite, S., Istrate, G.: Strong edge coloring for channel assignment in wireless radio networks. In: PERCOMW 2006, pp. 106\u2013110 (2006)","DOI":"10.1109\/PERCOMW.2006.129"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-540-72951-8_16","volume-title":"Structural Information and Communication Complexity","author":"J. Czyzowicz","year":"2007","unstructured":"Czyzowicz, J., Dobrev, S., Kranakis, E., Opatrny, J., Urrutia, J.: Local edge colouring of yao-like subgraphs of unit disk graphs. In: Prencipe, G., Zaks, S. (eds.) SIROCCO 2007. LNCS, vol.\u00a04474, pp. 195\u2013207. Springer, Heidelberg (2007)"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Gandham, S., Dawande, M., Prakash, R.: Link scheduling in sensor networks: distributed edge coloring revisited. In: INFOCOM, pp. 2492\u20132501 (2005)","DOI":"10.1109\/INFCOM.2005.1498534"},{"issue":"4","key":"18_CR4","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I. Holyer","year":"1981","unstructured":"Holyer, I.: The NP-completeness of edge-coloring. SIAM J. Comput.\u00a010(4), 718\u2013720 (1981)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"18_CR5","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1016\/j.jda.2006.03.020","volume":"5","author":"T. Ito","year":"2007","unstructured":"Ito, T., Kato, A., Zhou, X., Nishizeki, T.: Algorithms for finding distance-edge-colorings of graphs. J. Discrete Algorithms\u00a05(2), 304\u2013322 (2007)","journal-title":"J. Discrete Algorithms"},{"key":"18_CR6","unstructured":"Kanj, I., Wiese, A., Zhang, F.: Computing the k-hop neighborhoods locally. Technical report # 08-007 at: http:\/\/www.cdm.depaul.edu\/research\/Pages\/TechnicalReports.aspx"},{"issue":"4","key":"18_CR7","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1109\/TNET.2005.852873","volume":"13","author":"M. Kodialam","year":"2005","unstructured":"Kodialam, M., Nandagopal, T.: Characterizing achievable rates in multi-hop wireless mesh networks with orthogonal channels. IEEE\/ACM Trans. Netw.\u00a013(4), 868\u2013880 (2005)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"1","key":"18_CR8","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N. Linial","year":"1992","unstructured":"Linial, N.: Locality in distributed graph algorithms. SIAM J. Comput.\u00a021(1), 193\u2013201 (1992)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"18_CR9","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0166-218X(01)00237-2","volume":"118","author":"M. Mahdian","year":"2002","unstructured":"Mahdian, M.: On the computational complexity of strong edge coloring. Discrete Applied Mathematics\u00a0118(3), 239\u2013248 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Misra, J., Gries, D.: A constructive proof of vizing\u2019s theorem. IPL\u00a041 (1992)","DOI":"10.1016\/0020-0190(92)90041-S"},{"issue":"2","key":"18_CR11","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1023\/A:1019126406181","volume":"5","author":"S. Ramanathan","year":"1999","unstructured":"Ramanathan, S.: A unified framework and algorithm for channel assignment in wireless networks. Wirel. Netw.\u00a05(2), 81\u201394 (1999)","journal-title":"Wirel. Netw."},{"issue":"2","key":"18_CR12","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1109\/90.222924","volume":"1","author":"S. Ramanathan","year":"1993","unstructured":"Ramanathan, S., Lloyd, E.L.: Scheduling algorithms for multihop radio networks. IEEE\/ACM Trans. Netw.\u00a01(2), 166\u2013177 (1993)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"18_CR13","first-page":"25","volume":"3","author":"V. Vizing","year":"1964","unstructured":"Vizing, V.: On the estimate of the chromatic class of p-graphs. Diskret. Analiz\u00a03, 25\u201330 (1964)","journal-title":"Diskret. Analiz"},{"key":"18_CR14","unstructured":"Wiese, A., Kranakis, E.: Local construction and coloring of spanners of location aware unit disk graphs. Technical report # 07-18 at, http:\/\/www.scs.carleton.ca\/~kranakis\/Papers\/TR-07-18.pdf"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11409-0_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:40:20Z","timestamp":1606185620000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11409-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114083","9783642114090"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11409-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}