{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:44:56Z","timestamp":1774417496172,"version":"3.50.1"},"reference-count":11,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1992,10,1]],"date-time":"1992-10-01T00:00:00Z","timestamp":717897600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1992,10]]},"DOI":"10.1016\/0020-0190(92)90117-e","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:45:40Z","timestamp":1027655140000},"page":"309-314","source":"Crossref","is-referenced-by-count":1,"title":["A parallel algorithm for edge-coloring of graphs with edge-disjoint cycles"],"prefix":"10.1016","volume":"43","author":[{"given":"Eliezer A.","family":"Albacea","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90117-E_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"},{"key":"10.1016\/0020-0190(92)90117-E_BIB2","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1007\/BF01759076","article-title":"Deterministic parallel list ranking","volume":"6","author":"Anderson","year":"1991","journal-title":"Algorithmica"},{"key":"10.1016\/0020-0190(92)90117-E_BIB3","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF00998632","article-title":"Using Euler partitions to edge color bipartite multigraphs","volume":"5","author":"Gabow","year":"1976","journal-title":"Internat. J. Comput. Inform. Sci."},{"key":"10.1016\/0020-0190(92)90117-E_BIB4","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(92)90117-E_BIB5","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0020-0190(88)90080-4","article-title":"Parallel O(log n) time edge-colouring of trees and Halin graphs","volume":"27","author":"Gibbons","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(92)90117-E_BIB6","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0020-0190(90)90097-H","article-title":"Improved nonconservative sequential and parallel integer sorting","volume":"36","author":"Hagerup","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(92)90117-E_BIB7","series-title":"Proc. 26th Ann. Symp. on Foundations of Computer Science","first-page":"478","article-title":"Parallel tree contraction and its applications","author":"Miller","year":"1985"},{"key":"10.1016\/0020-0190(92)90117-E_BIB8","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/0022-0000(79)90053-9","article-title":"Linear algorithms on recursive representation of trees","volume":"18","author":"Mitchell","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(92)90117-E_BIB9","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/0020-0190(79)90049-8","article-title":"Linear algorithms for edge-coloring trees and unicyclic graphs","volume":"9","author":"Mitchell","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(92)90117-E_BIB10","first-page":"25","article-title":"On the estimate of the chromatic number of a graph","volume":"3","author":"Vizing","year":"1964","journal-title":"Diskret. Analiz."},{"key":"10.1016\/0020-0190(92)90117-E_BIB11","series-title":"Ph.D. Thesis","article-title":"The complexity of parallel computation","author":"Wyllie","year":"1979"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290117E?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290117E?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:21:29Z","timestamp":1555132889000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290117E"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,10]]},"references-count":11,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1992,10]]}},"alternative-id":["002001909290117E"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90117-e","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,10]]}}}