{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T06:03:33Z","timestamp":1673330613658},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[1996,9]]},"abstract":"<jats:p> Let G be a graph with n vertices and m edges and let its maximum degree be \u0394. It is shown that a valid edge coloring of G using at most 2\u0394\u22121 colors can be computed in O( log n log \u0394) time using O(m+n) processors on a CREW PRAM. Based on this, for any constant c&gt;1, a valid edge coloring for G using at most max([c\u0394], \u0394+1) colors can be computed in O( log <jats:sup>2<\/jats:sup> n) time, using O(m+n) processors. Employing different techniques, we show that it is possible to compute a \u0394<jats:sup>2<\/jats:sup> coloring in O( log * n) time, with O(m+n) processors. Also, a maximal matching of G can be computed in O( log <jats:sup>2<\/jats:sup> n log \u0394) time using O(m+n) processors on a CREW PRAM. <\/jats:p>","DOI":"10.1142\/s0129626496000315","type":"journal-article","created":{"date-parts":[[2004,10,28]],"date-time":"2004-10-28T14:29:23Z","timestamp":1098973763000},"page":"321-329","source":"Crossref","is-referenced-by-count":4,"title":["PARALLEL EDGE COLORING APPROXIMATION"],"prefix":"10.1142","volume":"06","author":[{"given":"MARTIN","family":"F\u00dcRER","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Pennsylvania State University, University Park, PA 16802, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"BALAJI","family":"RAGHAVACHARI","sequence":"additional","affiliation":[{"name":"Department of Computer Science, The University of Texas at Dallas, Box 830688, Richardson, TX 75083\u20130688, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626496000315","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T12:18:32Z","timestamp":1565093912000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626496000315"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":0,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[1996,9]]}},"alternative-id":["10.1142\/S0129626496000315"],"URL":"https:\/\/doi.org\/10.1142\/s0129626496000315","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}