{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T08:15:25Z","timestamp":1648628125031},"reference-count":10,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"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":7716,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1992,6]]},"DOI":"10.1016\/0304-3975(92)90358-m","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"335-344","source":"Crossref","is-referenced-by-count":1,"title":["A parallel algorithm for minimum weighted colouring of triangulated graphs"],"prefix":"10.1016","volume":"99","author":[{"given":"Ch\u00ednh T.","family":"Ho\u00e0ng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90358-M_BIB1","year":"1984"},{"key":"10.1016\/0304-3975(92)90358-M_BIB2","series-title":"Tech. Report 855","article-title":"The matching problem for strongly chordal graphs is in NC","author":"Dahlhaus","year":"1986"},{"key":"10.1016\/0304-3975(92)90358-M_BIB3","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0304-3975(92)90358-M_BIB4","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0020-0190(88)90178-0","article-title":"Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring of chordal graphs","volume":"28","author":"Ho","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(92)90358-M_BIB5","series-title":"Report OR90632","article-title":"Algorithms for minimum weighted colouring of perfectly ordered, comparability, triangulated, and clique separable graphs","author":"Ho\u00e0ng","year":"1990"},{"key":"10.1016\/0304-3975(92)90358-M_BIB6","first-page":"871","article-title":"Parallel algorithms for shared-memory machines","volume":"Vol. A","author":"Karp","year":"1990"},{"key":"10.1016\/0304-3975(92)90358-M_BIB7","series-title":"Proc. 29th Annual Symp. on Foundations of Computer Science","first-page":"150","article-title":"Efficient parallel algorithms for chordal graphs","author":"Klein","year":"1988"},{"key":"10.1016\/0304-3975(92)90358-M_BIB8","series-title":"MIT\/LCS\/TR-426","article-title":"Efficient parallel algorithms for planar, chordal, and interval graphs","author":"Klein","year":"1988"},{"issue":"27","key":"10.1016\/0304-3975(92)90358-M_BIB9","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","article-title":"Parallel prefix computation","volume":"4","author":"Ladner","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(92)90358-M_BIB10","series-title":"Proc. 19th Annual ACM Symposium on Theory of Computing","first-page":"355","article-title":"Fast parallel algorithms for chordal graphs","author":"Naor","year":"1987"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290358M?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290358M?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:58:25Z","timestamp":1555127905000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759290358M"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["030439759290358M"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90358-m","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}