{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:31Z","timestamp":1761611311448},"reference-count":8,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2002,3]]},"abstract":"<jats:p> In this paper we propose a parallel algorithm to construct a one-sided monotone polygon from a Hamiltonian 2-separator chordal graph. The algorithm requires O( log n) time and O(n) processors on the CREW PRAM model, where n is the number of vertices and m is the number of edges in the graph. We also propose parallel algorithms to recognize Hamiltonian 2-separator chordal graphs and to construct a Hamiltonian cycle in such a graph. They run in O( log <jats:sup>2<\/jats:sup> n) time using O(mn) processors on the CRCW PRAM model and O( log <jats:sup>2<\/jats:sup> n) time using O(m) processors on the CREW PRAM model, respectively. <\/jats:p>","DOI":"10.1142\/s0129626402000823","type":"journal-article","created":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T09:07:47Z","timestamp":1346490467000},"page":"51-64","source":"Crossref","is-referenced-by-count":2,"title":["PARALLEL ALGORITHMS FOR HAMILTONIAN 2-SEPARATOR CHORDAL GRAPHS"],"prefix":"10.1142","volume":"12","author":[{"given":"B. S.","family":"PANDA","sequence":"first","affiliation":[{"name":"Department of Computer and Information Sciences, University of Hyderabad, Hyderabad - 500 046, India"}]},{"given":"VIJAY","family":"NATARAJAN","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Duke University, Durham, USA"}]},{"given":"SAJAL K.","family":"DAS","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, The University of Texas at Arlington, Arlington, TX 76019-0015, USA"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1145\/358628.358650"},{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1137\/0217049"},{"issue":"4","key":"p_6","first-page":"797","volume":"25","author":"Klein P. N.","year":"1996","journal-title":"Computing"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1145\/359156.359164"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1979.4766903"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(94)00163-9"},{"key":"p_11","first-page":"30","volume":"405","author":"Sreenivasa Kumar P.","year":"1989","journal-title":"LNCS"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1137\/0214061"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626402000823","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T12:19:53Z","timestamp":1565093993000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626402000823"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":8,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2002,3]]}},"alternative-id":["10.1142\/S0129626402000823"],"URL":"https:\/\/doi.org\/10.1142\/s0129626402000823","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}