{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:20:29Z","timestamp":1759638029833},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1987,2,1]],"date-time":"1987-02-01T00:00:00Z","timestamp":539136000000},"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":9663,"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":[[1987,2]]},"DOI":"10.1016\/0166-218x(87)90068-0","type":"journal-article","created":{"date-parts":[[2003,1,17]],"date-time":"2003-01-17T17:34:03Z","timestamp":1042824843000},"page":"101-111","source":"Crossref","is-referenced-by-count":38,"title":["Some parallel algorithms on interval graphs"],"prefix":"10.1016","volume":"16","author":[{"given":"Alan A","family":"Bertossi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurizio A","family":"Bonuccelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(87)90068-0_BIB1","series-title":"Proc. 16th Annual ACM Symp. on Theory of Computing","first-page":"249","article-title":"Finding Euler circuits in logarithmic parallel time","author":"Awerbach","year":"1984"},{"key":"10.1016\/0166-218X(87)90068-0_BIB2","first-page":"97","article-title":"Finding Hamiltonian circuits in proper interval graphs","volume":"17","author":"Bertossi","year":"1983"},{"key":"10.1016\/0166-218X(87)90068-0_BIB3","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1137\/0211015","article-title":"Dominating sets in chordal graphs","volume":"11","author":"Booth","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(87)90068-0_BIB4","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1137\/0210049","article-title":"Parallel matrix and graph algorithms","volume":"10","author":"Dekel","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(87)90068-0_BIB5","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\/0166-218X(87)90068-0_BIB6","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1109\/TC.1983.1676223","article-title":"Binary trees and parallel scheduling algorithms","volume":"32","author":"Dekel","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(87)90068-0_BIB7","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0166-218X(87)90068-0_BIB8","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1002\/net.3230120410","article-title":"Efficient algorithms for interval graphs and circular arc graphs","volume":"12","author":"Gupta","year":"1982","journal-title":"Networks"},{"key":"10.1016\/0166-218X(87)90068-0_BIB9","series-title":"Proc. 16th Annual ACM Symp. on Theory of Computing","first-page":"266","article-title":"A fast parallel algorithm for the maximal independent set problem","author":"Karp","year":"1984"},{"key":"10.1016\/0166-218X(87)90068-0_BIB10","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0166-218X(86)90057-0","article-title":"An introduction to parallelism in combinatorial optimization","volume":"14","author":"Kindervater","year":"1986","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(87)90068-0_BIB11","series-title":"Efficient algorithms for new problems on interval graphs and interval models","author":"Manacher","year":"1984"},{"key":"10.1016\/0166-218X(87)90068-0_BIB12","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1145\/321879.321882","article-title":"Bounds to complexities of networks for sorting and switching","volume":"22","author":"Muller","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(87)90068-0_BIB13","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1137\/0602012","article-title":"An O(n2) algorithm for coloring proper circular arc graphs","volume":"2","author":"Orlin","year":"1981","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(87)90068-0_BIB14","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF02280884","article-title":"The NP-completeness of the bandwidth minimization problem","volume":"16","author":"Papadimitriou","year":"1976","journal-title":"Computing"},{"key":"10.1016\/0166-218X(87)90068-0_BIB15","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1145\/2514.2515","article-title":"Parallel graph algorithms","volume":"16","author":"Quinn","year":"1984","journal-title":"Comput. Surveys"},{"key":"10.1016\/0166-218X(87)90068-0_BIB16","series-title":"Discrete Mathematical Models, with Applications to Social, Biological and Environmental Problems","author":"Roberts","year":"1976"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X87900680?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X87900680?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T11:56:52Z","timestamp":1553947012000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X87900680"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,2]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,2]]}},"alternative-id":["0166218X87900680"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(87)90068-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1987,2]]}}}