{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T19:23:13Z","timestamp":1648668193614},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,10,1]],"date-time":"1995-10-01T00:00:00Z","timestamp":812505600000},"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":[[1995,10]]},"DOI":"10.1016\/0020-0190(95)00128-y","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:50:09Z","timestamp":1027605009000},"page":"37-44","source":"Crossref","is-referenced-by-count":0,"title":["Parallel algorithms for connectivity problems on interval graphs"],"prefix":"10.1016","volume":"56","author":[{"given":"Sanjeev","family":"Saxena","sequence":"first","affiliation":[]},{"given":"N.Malahal","family":"Rao","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(95)00128-Y_BIB1","series-title":"The Design and Analysis of Parallel Algorithms","author":"Akl","year":"1989"},{"key":"10.1016\/0020-0190(95)00128-Y_BIB2_1","article-title":"Paradigms for very fast parallel algorithms","author":"Berkman","year":"1991"},{"key":"10.1016\/0020-0190(95)00128-Y_BIB2_2","unstructured":"UMIACS-TR-91-117, University of Maryland."},{"key":"10.1016\/0020-0190(95)00128-Y_BIB3","series-title":"Proc. IEEE FOCS","first-page":"871","article-title":"Some triply-logarithmic parallel algorithms","author":"Berkman","year":"1990"},{"key":"10.1016\/0020-0190(95)00128-Y_BIB4","series-title":"3rd Workshop on Algorithms and Data Structures","article-title":"Triply-logarithmic upper and lower bounds for minimum, range minima and related problems with integer inputs, Manuscript","author":"Berkman","year":"1993"},{"key":"10.1016\/0020-0190(95)00128-Y_BIB5","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/BF01200429","article-title":"Randomized range-minima in nearly constant parallel time","volume":"2","author":"Berkman","year":"1992","journal-title":"Comput. Complexity"},{"key":"10.1016\/0020-0190(95)00128-Y_BIB6","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(95)00128-Y_BIB7","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1137\/0222013","article-title":"Scan first search and sparse certificates: An improved parallel algorithm for k-vertex connectivity","volume":"22","author":"Cheriyan","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(95)00128-Y_BIB8","doi-asserted-by":"crossref","unstructured":"S.K. Das, Calvin and C.Y. Chen, Efficient parallel algorithms on interval graphs, in: PARLE 92, Lecture Notes in Computer Science 605 (Springer, Berlin) 131\u2013141.","DOI":"10.1007\/3-540-55599-4_85"},{"key":"10.1016\/0020-0190(95)00128-Y_BIB9","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0020-0190(95)00128-Y_BIB10","series-title":"Proc. 5th ACM-SIAM Symp. on Discrete Algorithms","article-title":"Optimal parallel approximation algorithms for prefix sums and integer sorting","author":"Goodrich","year":"1994"},{"key":"10.1016\/0020-0190(95)00128-Y_BIB11","series-title":"Proc. 5th Ann. ACM Symp. on Parallel Algorithms and Architectures","article-title":"Fast deterministic approximate and exact parallel sorting","author":"Hagerup","year":"1993"},{"key":"10.1016\/0020-0190(95)00128-Y_BIB12","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0020-0190(95)00128-Y_BIB13","series-title":"Proc. ACM Computer Science Conf.","first-page":"48","article-title":"Efficent parallel algorithms for finding biconnected components of some intersection graphs","author":"Liang","year":"1991"},{"key":"10.1016\/0020-0190(95)00128-Y_BIB14","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01379098","article-title":"Optimal computation of prefix sums on a binary tree of processors","volume":"16","author":"Meijer","year":"1987","journal-title":"Internat. J. Parallel Programming"},{"key":"10.1016\/0020-0190(95)00128-Y_BIB15","series-title":"Proc. Internat. Conf. on Parallel Processing","first-page":"72","article-title":"Parallel algorithms on interval graphs","author":"Ramkumar","year":"1990"},{"key":"10.1016\/0020-0190(95)00128-Y_BIB16","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0190(92)90244-P","article-title":"Optimal parallel algorithms for finding cut vertices and bridges of interval graphs","volume":"42","author":"Sprague","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(95)00128-Y_BIB17","first-page":"83","article-title":"Efficient parallel computation of Hamiltonian paths and circuits in interval graphs","volume":"Vol. 3","author":"Sridhar","year":"1991"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909500128Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909500128Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T19:56:07Z","timestamp":1578513367000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909500128Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,10]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,10]]}},"alternative-id":["002001909500128Y"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(95)00128-y","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1995,10]]}}}