{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:54:24Z","timestamp":1760061264197,"version":"build-2065373602"},"reference-count":26,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s0743-7315(03)00115-1","type":"journal-article","created":{"date-parts":[[2003,8,12]],"date-time":"2003-08-12T12:35:01Z","timestamp":1060691701000},"page":"775-785","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["Fast parallel edge colouring of graphs"],"prefix":"10.1016","volume":"63","author":[{"given":"G.","family":"Sajith","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Saxena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0743-7315(03)00115-1_BIB1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0196-6774(89)90017-5","article-title":"A simple parallel tree contraction algorithm","volume":"10","author":"Abrahamson","year":"1989","journal-title":"J. Algorithms"},{"year":"1974","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","key":"10.1016\/S0743-7315(03)00115-1_BIB2"},{"key":"10.1016\/S0743-7315(03)00115-1_BIB3","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1016\/0022-0000(84)90003-5","article-title":"Finding Euler tours in parallel","volume":"29","author":"Atallah","year":"1984","journal-title":"J. Computer System Sci."},{"key":"10.1016\/S0743-7315(03)00115-1_BIB4","doi-asserted-by":"crossref","unstructured":"B.G. Baumgart, A polyhedron representation for computer vision, Proceedings, of the 1975 National Computer Conference, AFIPS Conference Proceedings, Vol. 44, 1975, pp. 589\u2013596.","DOI":"10.1145\/1499949.1500071"},{"key":"10.1016\/S0743-7315(03)00115-1_BIB5","doi-asserted-by":"crossref","first-page":"1026","DOI":"10.1145\/115234.115347","article-title":"Simulating (logcn)-wise independence in NC","volume":"38","author":"Berger","year":"1991","journal-title":"JACM"},{"year":"1979","series-title":"Graph Theory, An Introductory Course","author":"Bollobas","key":"10.1016\/S0743-7315(03)00115-1_BIB6"},{"key":"10.1016\/S0743-7315(03)00115-1_BIB7","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/0022-0000(85)90004-2","article-title":"A linear algorithm for embedding planar graphs using PQ-trees","volume":"30","author":"Chiba","year":"1985","journal-title":"J. Computer System Sci."},{"key":"10.1016\/S0743-7315(03)00115-1_BIB8","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0196-6774(89)90022-9","article-title":"Fast algorithms for edge-coloring planar graphs","volume":"10","author":"Chorbak","year":"1989","journal-title":"J. Algorithms"},{"key":"10.1016\/S0743-7315(03)00115-1_BIB9","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1137\/0211043","article-title":"On edge coloring bipartite graphs","volume":"11","author":"Cole","year":"1982","journal-title":"SIAM J. Comput."},{"year":"1977","series-title":"Edge-Colourings of Graphs","author":"Fiorini","key":"10.1016\/S0743-7315(03)00115-1_BIB10"},{"issue":"3","key":"10.1016\/S0743-7315(03)00115-1_BIB11","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."},{"key":"10.1016\/S0743-7315(03)00115-1_BIB12","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1137\/0211009","article-title":"Algorithms for edge coloring bipartite graphs and multigraphs","volume":"11","author":"Gabow","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0743-7315(03)00115-1_BIB13","doi-asserted-by":"crossref","first-page":"434","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\/S0743-7315(03)00115-1_BIB14","unstructured":"D.A. Grable, A. Panconesi, Nearly optimal distributed edge coloring in O(loglogn) rounds, in: Proceedings, Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997, pp. 278\u2013285."},{"key":"10.1016\/S0743-7315(03)00115-1_BIB15","doi-asserted-by":"crossref","unstructured":"Y. Han, Matching partition a linked list and its optimisation, SPAA 1989, 246\u2013253.","DOI":"10.1145\/72935.72961"},{"key":"10.1016\/S0743-7315(03)00115-1_BIB16","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."},{"year":"1992","series-title":"An Introduction to Parallel Algorithms","author":"J\u00e1J\u00e1","key":"10.1016\/S0743-7315(03)00115-1_BIB17"},{"year":"1995","series-title":"Graph Coloring Problems","author":"Jensen","key":"10.1016\/S0743-7315(03)00115-1_BIB18"},{"key":"10.1016\/S0743-7315(03)00115-1_BIB19","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"},{"issue":"2","key":"10.1016\/S0743-7315(03)00115-1_BIB20","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/TC.1981.6312171","article-title":"A fast parallel algorithm for routing in permutation networks","volume":"c-30","author":"Lev","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0743-7315(03)00115-1_BIB21","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":"55","author":"Liang","year":"1995","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0743-7315(03)00115-1_BIB22","unstructured":"W. Liang, Private communication, 1997."},{"key":"10.1016\/S0743-7315(03)00115-1_BIB23","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 Distributed Comput."},{"key":"10.1016\/S0743-7315(03)00115-1_BIB24","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0020-0190(92)90041-S","article-title":"A constructive proof for Vizing's theorem","volume":"41","author":"Misra","year":"1992","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"10.1016\/S0743-7315(03)00115-1_BIB25","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. Computer Systems Sci."},{"key":"10.1016\/S0743-7315(03)00115-1_BIB26","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0214061","article-title":"An efficient parallel biconnectivity algorithm","volume":"14","author":"Tarjan","year":"1985","journal-title":"SIAM J. Comput."}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731503001151?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731503001151?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T21:53:59Z","timestamp":1760046839000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743731503001151"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":26,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0743731503001151"],"URL":"https:\/\/doi.org\/10.1016\/s0743-7315(03)00115-1","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[2003,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Fast parallel edge colouring of graphs","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0743-7315(03)00115-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}