{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:16:32Z","timestamp":1725484592653},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424932"},{"type":"electronic","value":"9783540446767"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44676-1_29","type":"book-chapter","created":{"date-parts":[[2007,5,18]],"date-time":"2007-05-18T16:43:15Z","timestamp":1179506595000},"page":"345-355","source":"Crossref","is-referenced-by-count":5,"title":["Distributed O(\u0394 log n)-Edge-Coloring Algorithm"],"prefix":"10.1007","author":[{"given":"A.","family":"Czygrinow","sequence":"first","affiliation":[]},{"given":"M.","family":"Ha\u0144\u0107kowiak","sequence":"additional","affiliation":[]},{"given":"M.","family":"Karo\u0144ski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"issue":"1","key":"29_CR1","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N. Linial","year":"1992","unstructured":"N. Linial, Locality in distributed graph algorithms, SIAM Journal on Computing, 1992, 21(1), pp. 193\u2013201.","journal-title":"SIAM Journal on Computing"},{"key":"29_CR2","unstructured":"G. De Marco, A. Pelc, Fast distributed graph coloring with O(\u0394) colors, SODA 2001."},{"key":"29_CR3","unstructured":"M. Ha\u0144\u0107kowiak, M. Karo\u0144ski, A. Panconesi, A faster distributed algorithm for computing maximal matching deterministically, Proceedings of PODC 99, the Eighteen Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 219\u2013228."},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, A.V. Goldberg, M. Luby, and S. Plotkin, Network decomposition and locality in distributed computing, Proceedings of the 30th Symposium on Foundations of Computer Science (FOCS 1989), pp. 364\u2013369.","DOI":"10.1109\/SFCS.1989.63504"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44676-1_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T04:43:54Z","timestamp":1556426634000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44676-1_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424932","9783540446767"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-44676-1_29","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}