{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:48:28Z","timestamp":1752461308318},"reference-count":12,"publisher":"Informa UK Limited","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1080\/00207169908804868","type":"journal-article","created":{"date-parts":[[2007,6,26]],"date-time":"2007-06-26T00:23:52Z","timestamp":1182817432000},"page":"449-462","source":"Crossref","is-referenced-by-count":2,"title":["An optimal parallel algorithm to compute all cutvertices and blocks on permutation graphs"],"prefix":"10.1080","volume":"72","author":[{"given":"Debashis","family":"Bera","sequence":"first","affiliation":[]},{"given":"Tapan K.","family":"Pal","sequence":"additional","affiliation":[]},{"given":"Madhumangal","family":"Pal","sequence":"additional","affiliation":[]}],"member":"301","reference":[{"key":"CIT0001","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-9967-7","volume-title":"Graph Theory","author":"Bollobas B.","year":"1979"},{"key":"CIT0002","unstructured":"Das, S. K. and Chen, C. C. Y. 1992.Proc, 1992 International Conf. on Parallel Processing. Efficient parallel algorithm for computing articulation points and bridges of interval graphs. 1992. pp.III-164\u2013III-167."},{"key":"CIT0003","volume-title":"Graph theory with applications to engineering and computer science","author":"Deo N.","year":"1990"},{"key":"CIT0004","volume-title":"Algorithmic graph theory and perfect graphs","author":"Golumbic M. C.","year":"1980"},{"key":"CIT0005","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph theory","author":"Harary F.","year":"1969"},{"key":"CIT0006","unstructured":"Ramkumar, G. D. S. and Pandu Rangan, C. 1990.Proc: 1990 International Conf. on Parallel Processing. Parallel algorithms on interval graphs. 1990. pp.72\u201374."},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90244-P"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1137\/0214061"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1137\/0213036"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(96)00153-6"},{"key":"CIT0011","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF03008943","volume":"5","author":"Pal M.","year":"1998","journal-title":"Korean J. of Computational and Applied Mathematics"},{"key":"CIT0012","volume-title":"An optimal parallel algorithm for computing cut vertices and blocks on interval graphs, communicated","author":"Pal M."}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207169908804868","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,16]],"date-time":"2021-08-16T02:57:08Z","timestamp":1629082628000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/00207169908804868"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["10.1080\/00207169908804868"],"URL":"https:\/\/doi.org\/10.1080\/00207169908804868","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"value":"0020-7160","type":"print"},{"value":"1029-0265","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}