{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T19:23:44Z","timestamp":1648668224268},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,11,1]],"date-time":"1992-11-01T00:00:00Z","timestamp":720576000000},"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,11]]},"DOI":"10.1016\/0020-0190(92)90249-u","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"15-22","source":"Crossref","is-referenced-by-count":3,"title":["An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model"],"prefix":"10.1016","volume":"44","author":[{"given":"Ming-Shing","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng-Hsing","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90249-U_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579338","article-title":"Sorting in c log n steps","volume":"3","author":"Ajtai","year":"1983","journal-title":"Combinatorica"},{"key":"10.1016\/0020-0190(92)90249-U_BIB2","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0020-0190(88)90173-1","article-title":"On the domatic number of interval graph","volume":"28","author":"Bertossi","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(92)90249-U_BIB3","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0166-218X(85)90025-3","article-title":"Dominating sets and domatic number of circular-arc graphs","volume":"12","author":"Bonuccelli","year":"1985","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(92)90249-U_BIB4","first-page":"141","article-title":"Domination of undirected graphs \u2013 a survey","volume":"642","author":"Cockayne","year":"1978"},{"key":"10.1016\/0020-0190(92)90249-U_BIB5","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/TCS.1975.1083994","article-title":"Optimal domination in graphs","volume":"22","author":"Cockayne","year":"1975","journal-title":"IEEE Trans. Circuits and Systems"},{"key":"10.1016\/0020-0190(92)90249-U_BIB6","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1002\/net.3230070305","article-title":"Towards a theory of domination in graphs","volume":"7","author":"Cockayne","year":"1977","journal-title":"Networks"},{"key":"10.1016\/0020-0190(92)90249-U_BIB7","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","article-title":"Parallel merge sort","volume":"17","author":"Cole","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(92)90249-U_BIB8","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1137\/0217009","article-title":"Approximate parallel scheduling. Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time","volume":"17","author":"Cole","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(92)90249-U_BIB9","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1287\/opre.31.1.24","article-title":"Parallel scheduling algorithms","volume":"31","author":"Dekel","year":"1983","journal-title":"Oper. Res."},{"key":"10.1016\/0020-0190(92)90249-U_BIB10","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0166-218X(84)90061-1","article-title":"Domination, independent domination, and duality in strongly chordal graphs","volume":"7","author":"Farber","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(92)90249-U_BIB11","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1145\/359545.359553","article-title":"On the complexity of computing the measure of U[ai, bi]","volume":"21","author":"Fredman","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(92)90249-U_BIB12","series-title":"Computers and Intractability: A guide to the Theory of NP-completeness","author":"Gary","year":"1979"},{"key":"10.1016\/0020-0190(92)90249-U_BIB13","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0020-0190(92)90249-U_BIB14","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1109\/TC.1979.1675260","article-title":"An optimal solution for the channel-assignment problem","volume":"28","author":"Gupta","year":"1979","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(92)90249-U_BIB15","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1109\/TC.1985.6312202","article-title":"The power of parallel prefix","volume":"34","author":"Kruakal","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(92)90249-U_BIB16","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","article-title":"Parallel prefix computation","volume":"27","author":"Ladner","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(92)90249-U_BIB17","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1137\/0403045","article-title":"The domatic number problem in interval graphs","volume":"3","author":"Lu","year":"1990","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0020-0190(92)90249-U_BIB18","article-title":"Determining the domatic number and a domatic partition of an interval graph in time O(n) given its sorted model","author":"Manacher","year":"1991","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0020-0190(92)90249-U_BIB19","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0020-0190(89)90184-1","article-title":"Linear algorithm for domatic number problem on interval graphs","volume":"33","author":"Rao","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(92)90249-U_BIB20","series-title":"Graph Theory and its Applications to Problems of Society","author":"Roberts","year":"1978"},{"key":"10.1016\/0020-0190(92)90249-U_BIB21","first-page":"208","article-title":"Geometric intersection problems","author":"Shamos","year":"1976","journal-title":"Proc. 17th Ann. IEEE Symp. on Foundations of Computer Science"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290249U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290249U?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:28:52Z","timestamp":1555144132000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290249U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,11]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,11]]}},"alternative-id":["002001909290249U"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90249-u","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,11]]}}}