{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:55:49Z","timestamp":1725512149656},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540729181"},{"type":"electronic","value":"9783540729518"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72951-8_16","type":"book-chapter","created":{"date-parts":[[2007,7,2]],"date-time":"2007-07-02T00:03:25Z","timestamp":1183334605000},"page":"195-207","source":"Crossref","is-referenced-by-count":3,"title":["Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs"],"prefix":"10.1007","author":[{"given":"Jurek","family":"Czyzowicz","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Dobrev","sequence":"additional","affiliation":[]},{"given":"Evangelos","family":"Kranakis","sequence":"additional","affiliation":[]},{"given":"Jaroslav","family":"Opatrny","sequence":"additional","affiliation":[]},{"given":"Jorge","family":"Urrutia","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","volume-title":"IEEE International Workshop on Foundation and Algorithms for Wireless Networking","author":"T.C. Barrett","year":"2006","unstructured":"Barrett, T.C., et al.: Strong edge coloring for channel assignment in wireless radio networks. In: IEEE International Workshop on Foundation and Algorithms for Wireless Networking, IEEE, New York (2006)"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","first-page":"235","volume-title":"Principles of Distributed Systems","author":"E. Kranakis","year":"2006","unstructured":"Kranakis, E., et al.: Half-Space Proximal: A New Local Test for Extracting a Bounded Dilation Spanner of a Unit Disk Graph. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds.) OPODIS 2005. LNCS, vol.\u00a03974, pp. 235\u2013245. Springer, Heidelberg (2006a)"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","first-page":"286","volume-title":"Semantic Web Services and Web Process Composition","author":"E. Chavez","year":"2005","unstructured":"Chavez, E., et al.: Local construction of planar spanners in unit disk graphs with irregular transmission ranges. In: Cardoso, J., Sheth, A.P. (eds.) SWSWPC 2004. LNCS, vol.\u00a03387, pp. 286\u2013297. Springer, Heidelberg (2005b)"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1112\/S0025579300003260","volume":"9","author":"P. Erd\u00f6s","year":"1962","unstructured":"Erd\u00f6s, P.: On circuits and subgraphs of chromatic graphs. Mathematika\u00a09, 170\u2013175 (1962)","journal-title":"Mathematika"},{"key":"16_CR5","first-page":"2492","volume-title":"INFOCOM","author":"S. Gandham","year":"2005","unstructured":"Gandham, S., Dawande, M., Prakash, R.: Link scheduling in sensor networks: distributed edge coloring revisited. In: INFOCOM, pp. 2492\u20132501. IEEE Computer Society Press, Los Alamitos (2005)"},{"issue":"4","key":"16_CR6","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 Journal on Computing\u00a010(4), 718\u2013720 (1981)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"16_CR7","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1109\/TNET.2005.852873","volume":"13","author":"M.S. Kodialam","year":"2005","unstructured":"Kodialam, M.S., 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."},{"key":"16_CR8","first-page":"1021","volume-title":"Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004","author":"V.S.A. Kumar","year":"2004","unstructured":"Kumar, V.S.A., et al.: End-to-end packet-scheduling in wireless ad-hoc networks. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pp. 1021\u20131030. SIAM, Philadelphia (2004)"},{"issue":"10","key":"16_CR9","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1109\/TPDS.2003.1239871","volume":"14","author":"X.-Y. Li","year":"2003","unstructured":"Li, X.-Y., et al.: Localized delaunay triangulation with application in ad hoc wireless networks. IEEE Trans. Parallel Distrib. Syst.\u00a014(10), 1035\u20131047 (2003)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"16_CR10","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 Journal on Computing\u00a021(1), 193\u2013201 (1992)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"16_CR11","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/net.3230250205","volume":"25","author":"M.V. Marathe","year":"1995","unstructured":"Marathe, M.V., et al.: Simple heuristics for unit disk graphs. Networks\u00a025(1), 59\u201368 (1995)","journal-title":"Networks"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1007\/978-3-540-46515-7_16","volume-title":"Discrete and Computational Geometry","author":"T. Matsui","year":"2000","unstructured":"Matsui, T.: Approximation algorithms for maximum independent set problems and fractional coloring problems on unit disk graphs. In: Akiyama, J., Kano, M., Urabe, M. (eds.) JCDCG 1998. LNCS, vol.\u00a01763, pp. 194\u2013200. Springer, Heidelberg (2000)"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Naor, M., Stockmeyer, L.: What can be computed locally? SICOMP: SIAM Journal on Computing, vol. 24 (1995)","DOI":"10.1137\/S0097539793254571"},{"key":"16_CR14","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719772","volume-title":"Distributed Computing: A Locality-Sensitive Approach","author":"D. Peleg","year":"2000","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM, Philadelphia (2000)"},{"issue":"2","key":"16_CR15","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. Wireless Networks\u00a05(2), 81\u201394 (1999)","journal-title":"Wireless Networks"},{"key":"16_CR16","first-page":"25","volume":"3","author":"V.G. Vizing","year":"1964","unstructured":"Vizing, V.G.: On the estimate of the chromatic class of a p-graph. Diskret. Analiz.\u00a03, 25\u201330 (1964)","journal-title":"Diskret. Analiz."},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Wang, Y., Li, X.-Y.: Localized construction of bounded degree and planar spanner for wireless ad hoc networks. In: DialM: Proceedings of the Discrete Algorithms and Methods for Mobile Computing & Communications (2003)","DOI":"10.1145\/941079.941088"},{"issue":"4","key":"16_CR18","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1137\/0211059","volume":"11","author":"A. Yao","year":"1982","unstructured":"Yao, A.: On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM Journal on Computing\u00a011(4), 721\u2013736 (1982)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72951-8_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:08:49Z","timestamp":1605762529000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72951-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540729181","9783540729518"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72951-8_16","relation":{},"subject":[]}}