{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T06:49:00Z","timestamp":1648795740661},"reference-count":21,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1996,6,1]],"date-time":"1996-06-01T00:00:00Z","timestamp":833587200000},"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":["Parallel Computing"],"published-print":{"date-parts":[[1996,6]]},"DOI":"10.1016\/0167-8191(95)00007-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:18:22Z","timestamp":1027624702000},"page":"607-618","source":"Crossref","is-referenced-by-count":4,"title":["Partitioning graphs into Hamiltonian ones"],"prefix":"10.1016","volume":"22","author":[{"given":"Lin","family":"Chen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"8","key":"10.1016\/0167-8191(95)00007-0_BIB1","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1093\/comjnl\/36.8.756","article-title":"On the physical design of PRAMs","volume":"36","author":"Abolhassan","year":"1993","journal-title":"Computer J."},{"key":"10.1016\/0167-8191(95)00007-0_BIB2","series-title":"Proc. Int. Conf. on Parallel Processing","first-page":"393","article-title":"The star graph: an attractive alternative to the n-cube","author":"Akers","year":"1987"},{"key":"10.1016\/0167-8191(95)00007-0_BIB3","series-title":"Proc. 11th IFIP World Computer Congress","first-page":"515","article-title":"Broadcasting with selective reduction","author":"Akl","year":"1989"},{"issue":"5","key":"10.1016\/0167-8191(95)00007-0_BIB4","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0020-0190(95)00084-P","article-title":"Solving the shortest-paths problem on bipartite permutation graphs efficiently","volume":"55","author":"Chen","year":"1995","journal-title":"Information Processing Letters"},{"issue":"6","key":"10.1016\/0167-8191(95)00007-0_BIB5","first-page":"33","article-title":"Algorithms for three practical optimization problems","author":"Chen","year":"1990","journal-title":"Computer Research & Development"},{"issue":"3","key":"10.1016\/0167-8191(95)00007-0_BIB6","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0196-6774(91)90010-V","article-title":"Parallel recognition of the consecutive ones property with applications","volume":"12","author":"Chen","year":"1991","journal-title":"J. Algorithms"},{"issue":"1","key":"10.1016\/0167-8191(95)00007-0_BIB7","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/net.3230230105","article-title":"Efficient parallel algorithms for bipartite permutation graphs","volume":"23","author":"Chen","year":"1993","journal-title":"Networks"},{"issue":"3","key":"10.1016\/0167-8191(95)00007-0_BIB8","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/0890-5401(89)90036-9","article-title":"Faster optimal parallel prefix sums and list ranking","volume":"81","author":"Cole","year":"1989","journal-title":"Information and Computation"},{"key":"10.1016\/0167-8191(95)00007-0_BIB9","author":"Garey","year":"1979"},{"key":"10.1016\/0167-8191(95)00007-0_BIB10","series-title":"Computer Science and Applied Mathematics","author":"Golumbic","year":"1980"},{"key":"10.1016\/0167-8191(95)00007-0_BIB11","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0890-5401(87)90061-7","article-title":"Parallel recognition and decomposition of two terminal series parallel graphs","volume":"75","author":"He","year":"1987","journal-title":"Information and Computation"},{"key":"10.1016\/0167-8191(95)00007-0_BIB12","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"An n52 algorithm for maximum matchings in bipartite graphs","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. on Computing"},{"key":"10.1016\/0167-8191(95)00007-0_BIB13","author":"Hwang","year":"1993"},{"key":"10.1016\/0167-8191(95)00007-0_BIB14","first-page":"869","article-title":"Parallel algorithms for shared-memory machines","volume":"Vol. A","author":"Karp","year":"1990"},{"issue":"1","key":"10.1016\/0167-8191(95)00007-0_BIB15","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF02579407","article-title":"Constructing a perfect matching is in random NC","volume":"6","author":"Karp","year":"1986","journal-title":"Combinatorica"},{"issue":"2","key":"10.1016\/0167-8191(95)00007-0_BIB16","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/TC.1981.6312171","article-title":"A fast parallel algorithm for routing in permutation networks","volume":"C-30","author":"Lev","year":"1981","journal-title":"IEEE Trans. Computers"},{"issue":"3","key":"10.1016\/0167-8191(95)00007-0_BIB17","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1109\/71.210809","article-title":"An optimal implementation of broadcasting with selective reduction","volume":"4","author":"Lindon","year":"1993","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"key":"10.1016\/0167-8191(95)00007-0_BIB18","series-title":"Proc. 21st Ann. Symp. on Foundations of Computer Science","first-page":"17","article-title":"An O(\u221a\u00a6V\u0300\u00a6 \u00b7 \u00a6E\u00a6) algorithm for finding maximal matching in general graphs","author":"Micali","year":"1980"},{"key":"10.1016\/0167-8191(95)00007-0_BIB19","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0167-8191(95)00007-0_BIB20","doi-asserted-by":"crossref","first-page":"160","DOI":"10.4153\/CJM-1971-016-5","article-title":"Transitive orientation of graphs and identification of permutation graphs","volume":"23","author":"Pnueli","year":"1971","journal-title":"Canad. J. Math."},{"key":"10.1016\/0167-8191(95)00007-0_BIB21","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/S0166-218X(87)80003-3","article-title":"Bipartite permutation graphs","volume":"18","author":"Spinrad","year":"1987","journal-title":"Discrete Applied Math."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819195000070?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819195000070?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T03:20:13Z","timestamp":1555557613000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819195000070"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,6]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1996,6]]}},"alternative-id":["0167819195000070"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(95)00007-0","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1996,6]]}}}