{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T17:12:10Z","timestamp":1676826730123},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"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":7899,"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":[[1991,12]]},"DOI":"10.1016\/0304-3975(91)90265-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"1-21","source":"Crossref","is-referenced-by-count":6,"title":["Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs"],"prefix":"10.1016","volume":"91","author":[{"given":"A.","family":"Srinivasan","sequence":"first","affiliation":[]},{"given":"C.","family":"Pandu Rangan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(91)90265-4_BIB1","first-page":"151","article-title":"Cascading divide-and-conquer: a technique for designing parallel algorithms","author":"Atallah","year":"1987","journal-title":"Proc. 28th Ann. IEEE Symp. on FOCS"},{"key":"10.1016\/0304-3975(91)90265-4_BIB2","article-title":"An efficient algorithm for maxdominance, with applications","author":"Atallah","year":"1986","journal-title":"Purdue University Technical Report (CSD-TR-641)"},{"key":"10.1016\/0304-3975(91)90265-4_BIB3","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1109\/TC.1980.1675628","article-title":"An optimal worst-case algorithm for reporting intersections of rectangles","volume":"29","author":"Bentley","year":"1980","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(91)90265-4_BIB4","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0304-3975(87)90128-9","article-title":"On domination problems for permutation and other graphs","volume":"54","author":"Brandstadt","year":"1987","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/0304-3975(91)90265-4_BIB5","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\/0304-3975(91)90265-4_BIB6","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"issue":"10","key":"10.1016\/0304-3975(91)90265-4_BIB7","doi-asserted-by":"crossref","first-page":"942","DOI":"10.1109\/TC.1983.1676138","article-title":"Searching, merging, and sorting in parallel computation","volume":"32","author":"Kruskal","year":"1983","journal-title":"Proc. IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(91)90265-4_BIB8","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","article-title":"Parallel prefix computation","volume":"24","author":"Ladner","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(91)90265-4_BIB9","series-title":"Computational Geometry: An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/0304-3975(91)90265-4_BIB10","first-page":"457","article-title":"Transitive orientation in O(n2) time","author":"Spinrad","year":"1983","journal-title":"Proc. 15th Ann. ACM STOC"},{"key":"10.1016\/0304-3975(91)90265-4_BIB11","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0020-0190(85)90093-6","article-title":"Decomposing a set of points into chains with an application to permutation and circle graphs","volume":"21","author":"Supowit","year":"1985","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"10.1016\/0304-3975(91)90265-4_BIB12","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."},{"key":"10.1016\/0304-3975(91)90265-4_BIB13","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/0304-3975(88)90035-7","article-title":"An efficient parallel algorithm for updating minimum spanning trees","volume":"58","author":"Varman","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90265-4_BIB14","series-title":"Ph.D. thesis","article-title":"Predicate oriented database search algorithms","author":"Willard","year":"1978"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397591902654?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397591902654?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:56:16Z","timestamp":1555127776000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397591902654"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["0304397591902654"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90265-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}