{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T06:01:47Z","timestamp":1673330507132},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4521,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2001,3]]},"DOI":"10.1016\/s0166-218x(99)00190-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T18:17:26Z","timestamp":1027621046000},"page":"227-238","source":"Crossref","is-referenced-by-count":2,"title":["Very fast parallel algorithms for approximate edge coloring"],"prefix":"10.1016","volume":"108","author":[{"given":"Yijie","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weifa","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaojun","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(99)00190-0_BIB1","doi-asserted-by":"crossref","first-page":"1026","DOI":"10.1145\/115234.115347","article-title":"Simulating (logc n)-wise independence in NC","volume":"38","author":"Berger","year":"1991","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(99)00190-0_BIB2","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1142\/S0129626496000315","article-title":"Parallel edge coloring approximation","volume":"6","author":"F\u00fcrer","year":"1996","journal-title":"Parallel Process. Lett."},{"issue":"4","key":"10.1016\/S0166-218X(99)00190-0_BIB3","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1137\/0401044","article-title":"Parallel symmetry-breaking in sparse graphs","volume":"1","author":"Goldberg","year":"1988","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(99)00190-0_BIB4","doi-asserted-by":"crossref","unstructured":"D.A. Grable, A. Panconesi, Nearly optimal distributed edge coloring in O (log log n) rounds, Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, January, 1997, pp. 278\u2013285.","DOI":"10.1002\/(SICI)1098-2418(199705)10:3<385::AID-RSA6>3.3.CO;2-3"},{"key":"10.1016\/S0166-218X(99)00190-0_BIB5","doi-asserted-by":"crossref","unstructured":"Y. Han, Matching partition a linked list and its optimization, Proceedings of the First Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA\u201989), 1989, pp. 246\u2013253.","DOI":"10.1145\/72935.72961"},{"key":"10.1016\/S0166-218X(99)00190-0_BIB6","doi-asserted-by":"crossref","unstructured":"Y. Han, An optimal linked list prefix algorithm on a local memory computer, Proceedings of the 1989 Computer Science Conference (CSC\u201989), Feb. 1989, pp. 278\u2013286.","DOI":"10.1145\/75427.75462"},{"key":"10.1016\/S0166-218X(99)00190-0_BIB7","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","article-title":"The NP-completeness of edge coloring","volume":"10","author":"Holyer","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(99)00190-0_BIB8","unstructured":"J. J\u00e1J\u00e1, An Introduction to Parallel Algorithms, Addison-Wesley, Reading, MA, 1992."},{"key":"10.1016\/S0166-218X(99)00190-0_BIB9","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0196-6774(87)90026-5","article-title":"Efficient parallel algorithms for edge coloring problems","volume":"8","author":"Karloff","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(99)00190-0_BIB10","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0020-0190(95)00122-S","article-title":"Fast parallel algorithms for the approximate edge-coloring problem","volume":"56","author":"Liang","year":"1995","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(99)00190-0_BIB11","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1006\/jpdc.1996.0005","article-title":"Parallel algorithms for the edge-coloring and edge-coloring update problems","volume":"32","author":"Liang","year":"1996","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/S0166-218X(99)00190-0_BIB12","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0020-0190(92)90041-S","article-title":"A constructive proof of Vizing's theorem","volume":"41","author":"Misra","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(99)00190-0_BIB13","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1016\/S0022-0000(05)80069-8","article-title":"The probabilistic method yields deterministic parallel algorithms","volume":"49","author":"Motwani","year":"1994","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0166-218X(99)00190-0_BIB14","unstructured":"V.G. Vizing, On an estimate of the chromatic class of a p-graph, Diskret. Anal. 3 (1964) 25\u201330 (in Russian)."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99001900?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99001900?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T00:22:37Z","timestamp":1556065357000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X99001900"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S0166218X99001900"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00190-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}