{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:08:51Z","timestamp":1742400531480},"reference-count":16,"publisher":"Elsevier BV","issue":"4","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\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1992,6]]},"DOI":"10.1016\/0020-0190(92)90244-p","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"229-234","source":"Crossref","is-referenced-by-count":15,"title":["Optimal parallel algorithms for finding cut vertices and bridges of interval graphs"],"prefix":"10.1016","volume":"42","author":[{"given":"Alan P.","family":"Sprague","sequence":"first","affiliation":[]},{"given":"K.H.","family":"Kulkarni","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90244-P_BIB1","series-title":"The Design and Analysis of Parallel Algorithms","author":"Akl","year":"1989"},{"key":"10.1016\/0020-0190(92)90244-P_BIB2","first-page":"80","article-title":"Lower bounds for algebraic computation trees","author":"Ben-Or","year":"1983","journal-title":"Proc. 15th ACM Ann. Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(92)90244-P_BIB3","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\/0020-0190(92)90244-P_BIB4","series-title":"Graph Theory","author":"Bollobos","year":"1979"},{"key":"10.1016\/0020-0190(92)90244-P_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\/0020-0190(92)90244-P_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\/0020-0190(92)90244-P_BIB7","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0020-0190(92)90244-P_BIB8","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0020-0190(92)90244-P_BIB9","first-page":"766","article-title":"Optimal parallel algorithms on sorted intervals","author":"Kim","year":"1989","journal-title":"Proc. 27th Ann. Allerton Conf. on Comm., Control, and Computing"},{"key":"10.1016\/0020-0190(92)90244-P_BIB10","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1109\/TC.1985.6312202","article-title":"The power of parallel prefix","volume":"34","author":"Kruskal","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(92)90244-P_BIB11","first-page":"282","article-title":"Optimal parallel algorithms for problems modelled by a family of intervals","author":"Olariu","year":"1990","journal-title":"Proc. 28th Ann. Allerton Conf. on Comm., Control, and Computing"},{"key":"10.1016\/0020-0190(92)90244-P_BIB12","series-title":"Computational Geometry: An Introduction","author":"Preparata","year":"1988"},{"key":"10.1016\/0020-0190(92)90244-P_BIB13","first-page":"72","article-title":"Parallel algorithms on interval graphs","volume":"Vol. 3","author":"Ramkumar","year":"1990","journal-title":"Proc. 1990 Internat. Conf. on Parallel Processing"},{"key":"10.1016\/0020-0190(92)90244-P_BIB14","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\/0020-0190(92)90244-P_BIB15","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1137\/0213036","article-title":"Efficient parallel algorithms for a class of graph theoretic problems","volume":"13","author":"Tsin","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(92)90244-P_BIB16","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1109\/TCAD.1982.1269993","article-title":"Efficient algorithms for channel routing","volume":"1","author":"Yoshimura","year":"1982","journal-title":"IEEE Trans. Comput. Aided Design"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290244P?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290244P?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:27:29Z","timestamp":1555144049000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290244P"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["002001909290244P"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90244-p","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}