{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T22:25:13Z","timestamp":1747866313420,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642222115"},{"type":"electronic","value":"9783642222122"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22212-2_22","type":"book-chapter","created":{"date-parts":[[2011,7,21]],"date-time":"2011-07-21T03:22:50Z","timestamp":1311218570000},"page":"246-257","source":"Crossref","is-referenced-by-count":9,"title":["Distributed Coloring Depending on the Chromatic Number or the Neighborhood Growth"],"prefix":"10.1007","author":[{"given":"Johannes","family":"Schneider","sequence":"first","affiliation":[]},{"given":"Roger","family":"Wattenhofer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Arora, S., Chlamtac, E.: New approximation guarantee for chromatic number. In: Symp. on Theory of computing(STOC) (2006)","key":"22_CR1","DOI":"10.1145\/1132516.1132548"},{"doi-asserted-by":"crossref","unstructured":"Barenboim, L., Elkin, M.: Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition. In: PODC (2008)","key":"22_CR2","DOI":"10.1145\/1400751.1400757"},{"doi-asserted-by":"crossref","unstructured":"Barenboim, L., Elkin, M.: Distributed (\u03b4 + 1)-coloring in linear (in \u03b4) time. In: Symp. on Theory of computing(STOC) (2009)","key":"22_CR3","DOI":"10.1145\/1536414.1536432"},{"doi-asserted-by":"crossref","unstructured":"Barenboim, L., Elkin, M.: Deterministic distributed vertex coloring in polylogarithmic time. In: Symp. on Principles of distributed computing(PODC) (2010)","key":"22_CR4","DOI":"10.1145\/1835698.1835797"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1145\/176584.176586","volume":"41","author":"A. Blum","year":"1994","unstructured":"Blum, A.: New approximation algorithms for graph coloring. Journal of the ACM\u00a041, 470\u2013516 (1994)","journal-title":"Journal of the ACM"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0012-365X(78)90102-4","volume":"24","author":"B. Bollobas","year":"1978","unstructured":"Bollobas, B.: Chromatic nubmer, girth and maximal degree. Discrete Math.\u00a024, 311\u2013314 (1978)","journal-title":"Discrete Math."},{"issue":"1","key":"22_CR7","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1006\/jagm.2000.1097","volume":"37","author":"D.A. Grable","year":"2000","unstructured":"Grable, D.A., Panconesi, A.: Fast distributed algorithms for Brooks-Vizing colorings. J. Algorithms\u00a037(1), 85\u2013120 (2000)","journal-title":"J. Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Halld\u00f3rsson, M.M., Radhakrishnan, J.: Greed is good: approximating independent sets in sparse and bounded-degree graphs. In: STOC (1994)","key":"22_CR8","DOI":"10.1145\/195058.195221"},{"issue":"1","key":"22_CR9","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0196-6774(88)90006-5","volume":"9","author":"M. Karchmer","year":"1988","unstructured":"Karchmer, M., Naor, J.: A fast parallel algorithm to color a graph with delta colors. J. Algorithms\u00a09(1), 83\u201391 (1988)","journal-title":"J. Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Kuhn, F.: Weak Graph Coloring: Distributed Algorithms and Applications. In: Symp. on Parallelism in Algorithms and Architectures, SPAA (2009)","key":"22_CR10","DOI":"10.1145\/1583991.1584032"},{"doi-asserted-by":"crossref","unstructured":"Kuhn, F., Wattenhofer, R.: On the Complexity of Distributed Graph Coloring. In: Symp. on Principles of Distributed Computing (PODC) (2006)","key":"22_CR11","DOI":"10.1145\/1146381.1146387"},{"issue":"1","key":"22_CR12","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"},{"doi-asserted-by":"crossref","unstructured":"Panconesi, A., Srinivasan, A.: Improved distributed algorithms for coloring and network decomposition problems. In: Symp. on Theory of computing, STOC (1992)","key":"22_CR13","DOI":"10.1145\/129712.129769"},{"doi-asserted-by":"crossref","unstructured":"Schneider, J., Wattenhofer, R.: A Log-Star Distributed Maximal Independent Set Algorithm for Growth-Bounded Graphs. In: Symp. on Principles of Distributed Computing(PODC) (2008)","key":"22_CR14","DOI":"10.1145\/1400751.1400758"},{"doi-asserted-by":"crossref","unstructured":"Schneider, J., Wattenhofer, R.: A New Technique For Distributed Symmetry Breaking. In: Symp. on Principles of Distributed Computing(PODC) (2010)","key":"22_CR15","DOI":"10.1145\/1835698.1835760"},{"doi-asserted-by":"crossref","unstructured":"Schneider, J., Wattenhofer, R.: Distributed Coloring Depending on the Chromatic Number or the Neighborhood Growth. In: TIK Technical Report 335 (2011), ftp:\/\/ftp.tik.ee.ethz.ch\/pub\/publications\/TIK-Report-335.pdf","key":"22_CR16","DOI":"10.1007\/978-3-642-22212-2_22"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22212-2_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T01:06:44Z","timestamp":1560388004000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22212-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222115","9783642222122"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22212-2_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}