{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,12]],"date-time":"2025-09-12T19:41:37Z","timestamp":1757706097538},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1988,3,1]],"date-time":"1988-03-01T00:00:00Z","timestamp":573177600000},"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":[[1988,3]]},"DOI":"10.1007\/bf01934690","type":"journal-article","created":{"date-parts":[[2005,7,25]],"date-time":"2005-07-25T05:46:04Z","timestamp":1122270364000},"page":"1-18","source":"Crossref","is-referenced-by-count":8,"title":["Fast parallel graph searching with applications"],"prefix":"10.1007","volume":"28","author":[{"given":"Pranay","family":"Chaudhuri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01934690_CR1","unstructured":"D. A. Alton and D. M. Eckstein,Parallel breadth-first search of p-sparse graphs, Proc. West Coast Conf. on Combinatorics, Graph Theory, and Comput., California, (1979), pp. 79\u201393."},{"key":"BF01934690_CR2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321812.321815","volume":"21","author":"R. P. Brent","year":"1974","unstructured":"R. P. Brent,The parallel evaluation of general arithmetic expressions, J.ACM, 21; (1974), pp. 201\u2013206.","journal-title":"J.ACM"},{"key":"BF01934690_CR3","unstructured":"P. Chaudhuri,Algorithms for finding centers and medians of trees and graphs on a parallel computation model, J. Indian Inst. Sci., to appear."},{"key":"BF01934690_CR4","unstructured":"P. Chaudhuri,Fast parallel algorithms for a class of graph problems, J. Comb. Inf. Syst. Sci., to appear."},{"key":"BF01934690_CR5","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1080\/00207168708803592","volume":"22","author":"P. Chaudhuri","year":"1987","unstructured":"P. Chaudhuri,An O(logn)parallel algorithm for strong connectivity augmentation problem, Intern. J. Comp., Math., 22 (1987), pp. 187\u2013197.","journal-title":"Intern. J. Comp., Math."},{"key":"BF01934690_CR6","doi-asserted-by":"crossref","unstructured":"P. Chaudhuri,Algorithms for some graph problems on a distributed computational model, Information Sciences, to appear.","DOI":"10.1016\/0020-0255(87)90039-9"},{"key":"BF01934690_CR7","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1007\/BF01935049","volume":"26","author":"P. Chaudhuri","year":"1986","unstructured":"P. Chaudhuri and R. K. Ghosh,Parallel algorithms for analyzing activity networks, BIT, 26; (1986), pp. 418\u2013429.","journal-title":"BIT"},{"key":"BF01934690_CR8","volume-title":"Graph Theory: An Algorithmic Approach","author":"N. Christofides","year":"1975","unstructured":"N. Christofides,Graph Theory: An Algorithmic Approach, Academic Press, London, (1975)."},{"key":"BF01934690_CR9","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), pp. 657\u2013675.","journal-title":"SIAM J, Comput."},{"key":"BF01934690_CR10","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, N.J., (1974)."},{"key":"BF01934690_CR11","unstructured":"D. M. Eckstein and D. A. Alton,Parallel graph processing using depth-first search, Proc. Conf. Theoretical Computer Sci., Waterloo, Ontario, (1977)."},{"key":"BF01934690_CR12","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1080\/00207168408803413","volume":"15","author":"R. K. Ghosh","year":"1984","unstructured":"R. K. Ghosh and G. P. Bhattacharjee,Parallel breadth-first search algorithms for trees and graphs, Intern. J. Comp. Math., 15; (1984), pp. 255\u2013268.","journal-title":"Intern. J. Comp. Math."},{"key":"BF01934690_CR13","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1080\/00207168608803503","volume":"19","author":"T. Kim","year":"1986","unstructured":"T. Kim and K. Chwa,Parallel algorithms for a depth first search and a breadth first search, Intern. J. Comp., Math., 19; (1986), pp. 39\u201354.","journal-title":"Intern. J. Comp., Math."},{"key":"BF01934690_CR14","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0020-0190(82)90093-X","volume":"14","author":"L. Kucera","year":"1982","unstructured":"L. Kucera,Parallel computation and conflicts in memory access, Inform. Process. Lett., 14; (1982), pp. 93\u201396.","journal-title":"Inform. Process. Lett."},{"key":"BF01934690_CR15","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1137\/0207020","volume":"7","author":"E. Reghbati","year":"1978","unstructured":"E. Reghbati and D. G. Corneil,Parallel computations in graph theory, SIAM J. Comput., 7; (1978), pp. 230\u2013237.","journal-title":"SIAM J. Comput."},{"key":"BF01934690_CR16","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0190(85)90024-9","volume":"20","author":"J. H. Reif","year":"1985","unstructured":"J. H. Reif,Depth-first search is inherently sequential, Inform. Process. Lett., 20; (1985), pp. 229\u2013234.","journal-title":"Inform. Process. Lett."},{"key":"BF01934690_CR17","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1137\/0210051","volume":"10","author":"C. D. Savage","year":"1981","unstructured":"C. D. Savage and J. Ja'Ja',Fast, efficient parallel algorithms for some graph problems, SIAM J. Comput., 10; (1981), pp. 682\u2013691.","journal-title":"SIAM J. Comput."},{"key":"BF01934690_CR18","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"}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01934690.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01934690\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01934690","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T01:10:04Z","timestamp":1557450604000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01934690"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,3]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,3]]}},"alternative-id":["BF01934690"],"URL":"https:\/\/doi.org\/10.1007\/bf01934690","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,3]]}}}