{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T10:15:19Z","timestamp":1649153719866},"reference-count":6,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[1999,9]]},"abstract":"<jats:p> Provably fastest parallel algorithms for a number of problems on bipartite permutation graphs are presented here. These problems include, among others, connectivity, recognition, isomorphism detection, Hamiltonian path, and shortest path. The algorithms here all run in logarithmic time on CREW PRAM. The processor bound is the same as that for multiplying two matrices in logarithmic time on the model and is subcubic. <\/jats:p>","DOI":"10.1142\/s0129626499000359","type":"journal-article","created":{"date-parts":[[2003,2,26]],"date-time":"2003-02-26T10:09:39Z","timestamp":1046254179000},"page":"385-390","source":"Crossref","is-referenced-by-count":2,"title":["PROVABLY FASTEST PARALLEL ALGORITHMS FOR BIPARTITE PERMUTATION GRAPHS"],"prefix":"10.1142","volume":"09","author":[{"given":"LIN","family":"CHEN","sequence":"first","affiliation":[{"name":"FRL, P. O. Box 18345, Los Angeles,  CA 90018, USA"}]},{"given":"JULIUS Y.","family":"JIANG","sequence":"additional","affiliation":[{"name":"FRL, P. O. Box 18345, Los Angeles,  CA 90018, USA"}]},{"given":"MAUNG T.","family":"NYEU","sequence":"additional","affiliation":[{"name":"FRL, P. O. Box 18345, Los Angeles,  CA 90018, USA"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(95)00007-0"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230230105"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1137\/0215006"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80013-2"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(87)80003-3"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1109\/71.481592"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626499000359","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T16:19:12Z","timestamp":1565108352000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626499000359"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,9]]},"references-count":6,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[1999,9]]}},"alternative-id":["10.1142\/S0129626499000359"],"URL":"https:\/\/doi.org\/10.1142\/s0129626499000359","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,9]]}}}