{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T23:59:06Z","timestamp":1648598346393},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1997,5,1]],"date-time":"1997-05-01T00:00:00Z","timestamp":862444800000},"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":5921,"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":[[1997,5]]},"DOI":"10.1016\/s0166-218x(96)00052-2","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:19:33Z","timestamp":1049735973000},"page":"241-249","source":"Crossref","is-referenced-by-count":0,"title":["Parallel algorithms for the domination problems in trapezoid graphs"],"prefix":"10.1016","volume":"74","author":[{"given":"Y.Daniel","family":"Liang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(96)00052-2_BIB1","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0020-0190(93)90017-4","article-title":"Improved processor bounds for parallel algorithms for weighted directed graphs","volume":"45","author":"Amato","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(96)00052-2_BIB2","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0166-218X(87)90068-0","article-title":"Some parallel algorithms on interval graphs","volume":"16","author":"Bertossi","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(96)00052-2_BIB3","series-title":"Weighted domination on cocomparability graphs, manuscript","author":"Chang","year":"1994"},{"key":"10.1016\/S0166-218X(96)00052-2_BIB4","series-title":"Proc. 18th Southeast Conf. on Combinatorics, Graph theory and Computing","first-page":"267","article-title":"Extensions, of permutation and interval graphs","author":"Corneil","year":"1987"},{"key":"10.1016\/S0166-218X(96)00052-2_BIB5","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0166-218X(88)90032-7","article-title":"Trapezoid graphs and their coloring","volume":"21","author":"Dagan","year":"1988","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(96)00052-2_BIB6","series-title":"Handbook of Theoretical Computer Science","article-title":"Parallel algorithms for shared-memory machines","volume":"Vol. A","author":"Karp","year":"1990"},{"key":"10.1016\/S0166-218X(96)00052-2_BIB7","doi-asserted-by":"crossref","unstructured":"D. Kratsch and L. Stewart, Domination on cocomparability graphs, SIAM J. Discrete Math. 6 (3) 400\u2013417.","DOI":"10.1137\/0406032"},{"key":"10.1016\/S0166-218X(96)00052-2_BIB8","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0020-0190(94)00159-6","article-title":"Dominations in trapezoid graphs","volume":"52","author":"Liang","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(96)00052-2_BIB9","series-title":"Steiner set and connected domination in trapezoid graphs, manuscript","author":"Liang","year":"1994"},{"key":"10.1016\/S0166-218X(96)00052-2_BIB10","series-title":"Some efficient algorithms in trapezoid graphs and cocomparability graphs, manuscript","author":"Liang","year":"1994"},{"key":"10.1016\/S0166-218X(96)00052-2_BIB11","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0020-0190(92)90224-J","article-title":"Incorporating negative-weight vertices in certain vertex-search graph algorithms","volume":"42","author":"Manacher","year":"1992","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"10.1016\/S0166-218X(96)00052-2_BIB12","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0020-0190(82)90131-4","article-title":"Parallel algorithms for the connected components and minimal spanning tree problems","volume":"14","author":"Nath","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(96)00052-2_BIB13","series-title":"Proc. 28th Annual Allerton Conf.","first-page":"19","article-title":"An NC algorithm for the domination problem in permutation graphs","author":"Rhee","year":"1990"},{"key":"10.1016\/S0166-218X(96)00052-2_BIB14","author":"Rhee","year":"1994","journal-title":"An NC algorithm for the clique cover problem in cocomparability graphs and its application, manuscript"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000522?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000522?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:28:46Z","timestamp":1556130526000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X96000522"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,5]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,5]]}},"alternative-id":["S0166218X96000522"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(96)00052-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,5]]}}}