{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T06:05:41Z","timestamp":1747548341647},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1986,12,1]],"date-time":"1986-12-01T00:00:00Z","timestamp":533779200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1986,12]]},"DOI":"10.1007\/bf01935049","type":"journal-article","created":{"date-parts":[[2005,7,30]],"date-time":"2005-07-30T17:02:15Z","timestamp":1122742935000},"page":"418-429","source":"Crossref","is-referenced-by-count":9,"title":["Parallel algorithms for analyzing activity networks"],"prefix":"10.1007","volume":"26","author":[{"given":"Pranay","family":"Chaudhuri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ratan K.","family":"Ghosh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01935049_CR1","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1145\/828.322449","volume":"31","author":"M. J. Atallah","year":"1984","unstructured":"M. J. Atallah and S. R. Kosaraju,Graph problems on a mesh-connected processor array, J. ACM, 31; (1984), pp. 649\u2013667.","journal-title":"J. ACM"},{"key":"BF01935049_CR2","doi-asserted-by":"crossref","unstructured":"A. Borodin and J. E. Hopcroft,Routing, merging and sorting on parallel models of computation, Proc. 14th ACM Symp. on Theory of Comput., (1982), pp. 338\u2013344.","DOI":"10.1145\/800070.802209"},{"key":"BF01935049_CR3","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1080\/00207218608920823","volume":"60","author":"P. Chaudhuri","year":"1986","unstructured":"P. Chaudhuri,Distributed algorithm for analysing activity networks, Int. J. Electronics, 60; (1986), pp. 603\u2013607.","journal-title":"Int. J. Electronics"},{"key":"BF01935049_CR4","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1137\/0210049","volume":"10","author":"E. Dekel","year":"1981","unstructured":"E. Dekel, D. Nassimi and S. Sahni,Parallel matrix and graph algorithms, SIAM J. Comput., 10; (1981), 657\u2013675.","journal-title":"SIAM J. Comput."},{"key":"BF01935049_CR5","volume-title":"Graph Theory with Applications to Engineering and Computer Science","author":"N. Deo","year":"1974","unstructured":"N. Deo,Graph Theory with Applications to Engineering and Computer Science, Prentice Hall, Inc., Englewood Cliffs, NY, (1974)."},{"key":"BF01935049_CR6","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/BF01937481","volume":"24","author":"R. K. Ghosh","year":"1984","unstructured":"R. K. Ghosh and G. P. Bhattacharjee,A parallel search algorithm for directed acyclic graphs, BIT 24; (1984), pp. 134\u2013150.","journal-title":"BIT"},{"key":"BF01935049_CR7","volume-title":"Introduction of Operations Research \u2014 a Computer Oriented Algorithmic Approach","author":"B. E. Gillett","year":"1976","unstructured":"B. E. Gillett,Introduction of Operations Research \u2014 a Computer Oriented Algorithmic Approach, McGraw-Hill, Inc. NY, (1976)."},{"key":"BF01935049_CR8","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF02254849","volume":"29","author":"P. Mateti","year":"1982","unstructured":"P. Mateti and N. Deo,Parallel algorithms for the single source shortest path problem, Computing, 29; (1982), pp. 31\u201349.","journal-title":"Computing"},{"key":"BF01935049_CR9","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0196-6774(81)90010-9","volume":"2","author":"Y. Shiloach","year":"1981","unstructured":"Y. Shiloach and U. Vishkin,Finding the maximum, merging and sorting in a parallel computation model, J. Algorithms, 2; (1981), pp. 88\u2013102.","journal-title":"J. Algorithms"},{"key":"BF01935049_CR10","unstructured":"R. E. Tarjan and U. Vishkin,An efficient parallel biconnectivity algorithm, TR-69, Dept. of Comp. Sci., Courant Institute, NYU, (1983)."},{"key":"BF01935049_CR11","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF02136031","volume":"24","author":"D. Y. Yeh","year":"1984","unstructured":"D. Y. Yeh and D. T. Lee,Graph algorithms on a tree structured parallel computer, BIT 24; (1984), pp. 333\u2013340.","journal-title":"BIT"}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01935049.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01935049\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01935049","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T16:03:19Z","timestamp":1557763399000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01935049"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,12]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1986,12]]}},"alternative-id":["BF01935049"],"URL":"https:\/\/doi.org\/10.1007\/bf01935049","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,12]]}}}