{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T02:47:56Z","timestamp":1649040476170},"reference-count":40,"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)90143-w","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:52:02Z","timestamp":1062611522000},"page":"143-158","source":"Crossref","is-referenced-by-count":16,"title":["Parallel graph algorithms for hypercube computers"],"prefix":"10.1016","volume":"13","author":[{"given":"Sajal K","family":"Das","sequence":"first","affiliation":[]},{"given":"Narsingh","family":"Deo","sequence":"additional","affiliation":[]},{"given":"Sushil","family":"Prasad","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(90)90143-W_BIB1","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1145\/828.322449","article-title":"Graph problems on a mesh-connected processor array","volume":"31","author":"Atallah","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/0167-8191(90)90143-W_BIB2","doi-asserted-by":"crossref","first-page":"1258","DOI":"10.1109\/TC.1987.1676869","article-title":"New connectivity and MSF algorithms for shuffle-exchange network and PRAM","volume":"36","author":"Awerbuch","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(90)90143-W_BIB3","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0196-6774(80)90004-8","article-title":"A parallel algorithm for constructing minimum spanning trees","volume":"1","author":"Bentley","year":"1980","journal-title":"J. Algorithms"},{"key":"10.1016\/0167-8191(90)90143-W_BIB4","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0020-0190(71)90005-6","article-title":"An n2 algorithm for determining the bridges of a graph","volume":"1","author":"Corneil","year":"1971","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0167-8191(90)90143-W_BIB5","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1109\/31.1744","article-title":"Divide-and-conquer based optimal parallel algorithms for some graph problems on EREW PRAM model","volume":"35","author":"Das","year":"1988","journal-title":"IEEE Trans. Circuits and Systems"},{"key":"10.1016\/0167-8191(90)90143-W_BIB6","article-title":"Two minimum spanning forest algorithms on hypercube computers","author":"Das","year":"1988"},{"key":"10.1016\/0167-8191(90)90143-W_BIB7","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1137\/0210049","article-title":"Parallel matrix and graph algorithms","volume":"10","author":"Dekel","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-8191(90)90143-W_BIB8","series-title":"Proc. Int. Conf. Parallel Process","first-page":"661","article-title":"Scalability of a binary tree on a hypercube","author":"Deshpande","year":"1986"},{"key":"10.1016\/0167-8191(90)90143-W_BIB9","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"Two problems in connexion with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"key":"10.1016\/0167-8191(90)90143-W_BIB10","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1109\/TC.1987.1676928","article-title":"Optimal graph algorithms on a fixed-size linear array","volume":"36","author":"Doshi","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(90)90143-W_BIB11","author":"ENCORE Computer Corp","year":"1987","journal-title":"Multimax Technical Summary"},{"key":"10.1016\/0167-8191(90)90143-W_BIB12","series-title":"Proc. Int. Conf. Parallel Process","first-page":"6","article-title":"The traveling salesman problem on a hypercube, MIMD computer","author":"Felton","year":"1985"},{"key":"10.1016\/0167-8191(90)90143-W_BIB13","series-title":"Proc. Int. Conf. Parallel Process","first-page":"711","article-title":"An efficient connected components algorithm on a mesh-connected computer","author":"Gopalakrishnan","year":"1985"},{"key":"10.1016\/0167-8191(90)90143-W_BIB14","series-title":"Proc. Int. Conf. Parallel Process","first-page":"653","article-title":"Architecture of a hypercube supercomputer","author":"Hayes","year":"1986"},{"key":"10.1016\/0167-8191(90)90143-W_BIB15","series-title":"The Connection Machine","author":"Hillis","year":"1985"},{"key":"10.1016\/0167-8191(90)90143-W_BIB16","series-title":"Fundamentals of Computer Algorithms","author":"Horowitz","year":"1978"},{"key":"10.1016\/0167-8191(90)90143-W_BIB17","first-page":"134","article-title":"An overview of the Butterfly GP1000: A large-scale parallel UNIX computer","volume":"Vol. II","author":"Howe","year":"1988"},{"key":"10.1016\/0167-8191(90)90143-W_BIB18","series-title":"Proc. 26th Annual IEEE Symp. Foundations Comput. Sci.","first-page":"232","article-title":"Solving some graph problems with optimal or near-optimal speedup on mesh-of-trees networks","author":"Huang","year":"1985"},{"key":"10.1016\/0167-8191(90)90143-W_BIB19","author":"INTEL Corp","year":"1986","journal-title":"iPSC Systems Overview"},{"key":"10.1016\/0167-8191(90)90143-W_BIB20","series-title":"Proc. Int. Conf. Parallel Process","first-page":"713","article-title":"All pairs shortest paths on a hypercube multiprocessor","author":"Jenq","year":"1987"},{"key":"10.1016\/0167-8191(90)90143-W_BIB21","first-page":"48","article-title":"On the shortest spanning subtree of a graph and the traveling salesman problem","volume":"7","author":"Kruskal","year":"1956"},{"key":"10.1016\/0167-8191(90)90143-W_BIB22","series-title":"Proc. 1983 Int. Workshop Graph Theoretic Concepts Comput. Sci.","first-page":"200","article-title":"Parallel computation using mesh-of-trees","author":"Leighton","year":"1983"},{"key":"10.1016\/0167-8191(90)90143-W_BIB23","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1137\/0216004","article-title":"Data movement techniques for the Pyramid computer","volume":"16","author":"Miller","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-8191(90)90143-W_BIB24","series-title":"Proc. 1986 SIAM Conf. Hypercube Multiprocessors","first-page":"418","article-title":"Graph and image processing algorithmas for the hypercube","author":"Miller","year":"1987"},{"key":"10.1016\/0167-8191(90)90143-W_BIB25","doi-asserted-by":"crossref","first-page":"744","DOI":"10.1137\/0209058","article-title":"Finding connected components and connected ones on a mesh-connected computer","volume":"9","author":"Nassimi","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-8191(90)90143-W_BIB26","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0020-0190(82)90131-4","article-title":"Parallel algorithms for the connected components and minimal spanning tree problems","volume":"14","author":"Nath","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0167-8191(90)90143-W_BIB27","series-title":"Second Int. SIAM Conf. Vector and Parallel Computing","article-title":"Solving a class of graph problems on hypercube computers","author":"Prasad","year":"1988"},{"key":"10.1016\/0167-8191(90)90143-W_BIB28","doi-asserted-by":"crossref","first-page":"1389","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. Syst. Tech. J."},{"key":"10.1016\/0167-8191(90)90143-W_BIB29","series-title":"Designing Efficient Algorithms for Parallel Computers","author":"Quinn","year":"1987"},{"key":"10.1016\/0167-8191(90)90143-W_BIB30","article-title":"Implementing best-first branch-and-bound algorithms on hypercube multicomputers","author":"Quinn","year":"1986","journal-title":"Private Communication"},{"key":"10.1016\/0167-8191(90)90143-W_BIB31","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1145\/2514.2515","article-title":"Parallel graph algorithms","volume":"16","author":"Quinn","year":"1984","journal-title":"Comput. Surveys"},{"key":"10.1016\/0167-8191(90)90143-W_BIB32","series-title":"Combinatorial Algorithms: Theory and Practice","author":"Reingold","year":"1977"},{"key":"10.1016\/0167-8191(90)90143-W_BIB33","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/2465.2467","article-title":"The Cosmic Cube","volume":"28","author":"Seitz","year":"1985","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-8191(90)90143-W_BIB34","author":"SEQUENT Comput. Systems Inc","year":"1986","journal-title":"Balance Technical Summary"},{"key":"10.1016\/0167-8191(90)90143-W_BIB35","series-title":"Proc. Int. Conf. Parallel Process","first-page":"727","article-title":"Tree-based graph algorithms for some parallel computers","author":"Stout","year":"1985"},{"key":"10.1016\/0167-8191(90)90143-W_BIB36","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-8191(90)90143-W_BIB37","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/0020-0190(74)90003-9","article-title":"A note on finding the bridges of a graph","volume":"2","author":"Tarjan","year":"1974","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0167-8191(90)90143-W_BIB38","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","article-title":"On the efficiency of a good but not linear set merging algorithm","volume":"22","author":"Tarjan","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/0167-8191(90)90143-W_BIB39","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0020-0255(86)90013-7","article-title":"Finding fundamental cycles and bridges on a tree-structured parallel computer","volume":"40","author":"Yeh","year":"1986","journal-title":"Inform. Sci."},{"key":"10.1016\/0167-8191(90)90143-W_BIB40","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF02136031","article-title":"Graph algorithms on a tree-structured parallel computer","volume":"24","author":"Yeh","year":"1984","journal-title":"BIT"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919090143W?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919090143W?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:31Z","timestamp":1551086731000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016781919090143W"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,2]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,2]]}},"alternative-id":["016781919090143W"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(90)90143-w","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1990,2]]}}}