{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T07:31:56Z","timestamp":1757575916656},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,2,1]],"date-time":"1990-02-01T00:00:00Z","timestamp":633830400000},"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":[[1990,2]]},"DOI":"10.1016\/0167-8191(90)90151-x","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:52:02Z","timestamp":1062611522000},"page":"245-251","source":"Crossref","is-referenced-by-count":2,"title":["Graph search algorithms and maximum bipartite matching algorithm on the hypercube network model"],"prefix":"10.1016","volume":"13","author":[{"given":"Jang-Ping","family":"Sheu","sequence":"first","affiliation":[]},{"given":"Nan-Ling","family":"Kuo","sequence":"additional","affiliation":[]},{"given":"Gen-Huey","family":"Chen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(90)90151-X_BIB1","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connection with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"key":"10.1016\/0167-8191(90)90151-X_BIB2","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/BF01937481","article-title":"A parallel search algorithm for directed acyclic graphs","volume":"24","author":"Ghosh","year":"1984","journal-title":"Bit"},{"key":"10.1016\/0167-8191(90)90151-X_BIB3","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1080\/00207168408803413","article-title":"Parallel breadth first search algorithms for trees and graphs","volume":"15","author":"Ghosh","year":"1984","journal-title":"Internat. J. Comput. Math."},{"issue":"4","key":"10.1016\/0167-8191(90)90151-X_BIB4","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1137\/0202019","article-title":"An O(n2.5) algorithm for maximum matching in bipartite graphs","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-8191(90)90151-X_BIB5","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1080\/00207168608803503","article-title":"Parallel algorithms for a depth first search and a breadth first search","volume":"19","author":"Kim","year":"1986","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/0167-8191(90)90151-X_BIB6","doi-asserted-by":"crossref","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalizations","volume":"36","author":"Prim","year":"1957","journal-title":"Bell System Tech. J."},{"issue":"2","key":"10.1016\/0167-8191(90)90151-X_BIB7","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1137\/0207020","article-title":"Parallel computations in graph theory","volume":"2","author":"Reghbati","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-8191(90)90151-X_BIB8","article-title":"Topological properties of hypercubes","author":"Saad","year":"1985","journal-title":"Research Report YALEU\/DCS\/RR-389 Yale University"},{"key":"10.1016\/0167-8191(90)90151-X_BIB9","article-title":"Data communication in hypercubes","author":"Saad","year":"1985","journal-title":"Research Report YALEU\/DCS\/RR-428 Yale University"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919090151X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919090151X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T09:25:28Z","timestamp":1551086728000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016781919090151X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,2]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,2]]}},"alternative-id":["016781919090151X"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(90)90151-x","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1990,2]]}}}