{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T09:39:24Z","timestamp":1649065164168},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1982,3,1]],"date-time":"1982-03-01T00:00:00Z","timestamp":383788800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1982,3]]},"DOI":"10.1007\/bf02254849","type":"journal-article","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T21:33:57Z","timestamp":1132695237000},"page":"31-49","source":"Crossref","is-referenced-by-count":10,"title":["Parallel algorithms for the single source shortest path problem"],"prefix":"10.1007","volume":"29","author":[{"given":"P.","family":"Mateti","sequence":"first","affiliation":[]},{"given":"N.","family":"Deo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02254849_CR1","unstructured":"Arjomandi, E.: A study of parallelism in graph theory. Doctoral thesis, TR 86, Dept. of Computer Science, Univ. of Toronto, 1975."},{"key":"BF02254849_CR2","volume-title":"Computer systems architecture, ch. 10","author":"J. L. Baer","year":"1980","unstructured":"Baer, J. L.: Computer systems architecture, ch. 10., Potomac, Md.: Computer Science Press 1980."},{"key":"BF02254849_CR3","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0196-6774(80)90004-8","volume":"1","author":"J. L. Bentley","year":"1980","unstructured":"Bentley, J. L.: A parallel algorithm for constructing minimum spanning trees. J. Algorithms1, 51\u201359 (1980).","journal-title":"J. Algorithms"},{"key":"BF02254849_CR4","unstructured":"Bentley, J. L., Kung, H. T.: A tree machine for searching problems. Proc. International Conf. on Parallel Processing, August 1979, pp. 257\u2013266."},{"key":"BF02254849_CR5","volume-title":"The mtree machine: a highly concurrent computing environment","author":"S. A. Browning","year":"1980","unstructured":"Browning, S. A.: The mtree machine: a highly concurrent computing environment. Ph. D. Thesis, Computer Science Department, California Institute of Technology, Pasadena, Calif., 1980."},{"key":"BF02254849_CR6","volume-title":"Graph theory with applications to engineering and computer science","author":"N. Deo","year":"1974","unstructured":"Deo, N.: Graph theory with applications to engineering and computer science. Englewood Cliffs, N. J.: Prentice-Hall 1974."},{"key":"BF02254849_CR7","volume-title":"A note on worst case complexity of Ford-Bellman-Moore algorithm","author":"N. Deo","year":"1981","unstructured":"Deo, N., Krishnamoorthy, M. S.: A note on worst case complexity of Ford-Bellman-Moore algorithm. Computer Science Department, Washington State University, pullman, Wash., Technical Report CS-81-076, October 1981."},{"key":"BF02254849_CR8","volume-title":"Shortest path algorithms: taxonomy and annotation","author":"N. Deo","year":"1980","unstructured":"Deo, N., Pang, C. Y.: Shortest path algorithms: taxonomy and annotation. Computer Science Department, Washington State University, Pullman, Wash., Technical Report No. CS-80-057, March. 1980."},{"key":"BF02254849_CR9","unstructured":"Deo, N., Pang, C. Y., Lord, R. E.: Two parallel algorithms for shortest path problems. Proc. International Conf. on Parallel Processing, August 26\u201329, 1980, pp. 244\u2013253."},{"key":"BF02254849_CR10","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E. Dijkstra","year":"1959","unstructured":"Dijkstra, E.: A note on two problems in connexion with graphs. Numerische Mathematik1, 269\u2013271 (1959).","journal-title":"Numerische Mathematik"},{"key":"BF02254849_CR11","volume-title":"Parallel processing using depth-first and breadth-first search","author":"D. M. Eckstein","year":"1977","unstructured":"Eckstein, D. M.: Parallel processing using depth-first and breadth-first search. Doctoral thesis, Department of Computer Science, University of Iowa City, Iowa, July 1977."},{"key":"BF02254849_CR12","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1145\/359138.359141","volume":"22","author":"D. S. Hirschberg","year":"1979","unstructured":"Hirschberg, D. S., Chandra, A. K., Sarwate, D. V.: Computing connected components on parallel computers. Comm. ACM22, 461\u2013464 (1979).","journal-title":"Comm. ACM"},{"key":"BF02254849_CR13","volume-title":"Fundamentals of computer algorithms","author":"E. Horowitz","year":"1978","unstructured":"Horowitz, E., Sahni, S.: Fundamentals of computer algorithms. Potomac, Md.: Computer Science Press 1978."},{"key":"BF02254849_CR14","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1145\/321765.321768","volume":"20","author":"D. B. Johnson","year":"1973","unstructured":"Johnson, D. B.: A note on Dijkstra's shortest path algorithm. J. ACM20, 385\u2013388 (1973).","journal-title":"J. ACM"},{"key":"BF02254849_CR15","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1145\/360248.360251","volume":"19","author":"R. M. Keller","year":"1976","unstructured":"Keller, R. M.: Formal verification of parallel programs. Comm. ACM19, 371\u2013384 (1976).","journal-title":"Comm. ACM"},{"key":"BF02254849_CR16","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0065-2458(08)60033-9","volume":"19","author":"H. T. Kung","year":"1980","unstructured":"Kung, H. T.: The structure of parallel algorithms. Advances in Computers19, 65\u2013112 (1980).","journal-title":"Advances in Computers"},{"key":"BF02254849_CR17","doi-asserted-by":"crossref","unstructured":"Lamport, L.: A new technique for proving the correctness of multiprocess programs. ACM TOPLAS, 1980.","DOI":"10.1145\/357084.357093"},{"key":"BF02254849_CR18","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1109\/TSE.1977.229904","volume":"3","author":"L. Lamport","year":"1977","unstructured":"Lamport, L.: Proving the correctiness of multiprocess programs. IEEE Trans. Software Engg.3, 125\u2013143 (1977).","journal-title":"IEEE Trans. Software Engg."},{"key":"BF02254849_CR19","volume-title":"Combinatorial optimization: networks and matroids","author":"E. L. Lawler","year":"1976","unstructured":"Lawler, E. L.: Combinatorial optimization: networks and matroids. New York: Holt, Rinehart and Winston 1976."},{"key":"BF02254849_CR20","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1109\/TSE.1981.230833","volume":"7","author":"B. Lint","year":"1981","unstructured":"Lint, B., Agerwala, T.: communication issues in the design of parallel algorithms. IEEE Trans. Software Engg. SE-7, 174\u2013188 (1981).","journal-title":"IEEE Trans. Software Engg."},{"key":"BF02254849_CR21","unstructured":"Moore, E. G.: The shortest paths through a maze. Proc. Internat. Symp. on Theory of Switching, 1957, pp. 285\u2013292."},{"key":"BF02254849_CR22","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1145\/360051.360224","volume":"19","author":"S. Owicki","year":"1976","unstructured":"Owicki, S., Gries, D.: Verifying properties of parallel programs: an axiomatic approach. Comm. ACM19, 279\u2013284 (1976).","journal-title":"Comm. ACM"},{"key":"BF02254849_CR23","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1145\/355900.355919","volume":"6","author":"U. Pape","year":"1980","unstructured":"Pape, U.: Algorithm 562: shortest path lengths. ACM Trans. on Math. Software6, 450\u2013455 (1980).","journal-title":"ACM Trans. on Math. Software"},{"key":"BF02254849_CR24","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0304-3975(81)90110-9","volume":"13","author":"A. Pneuli","year":"1981","unstructured":"Pneuli, A.: The temporal semantics of concurrent programs. Theoretical Computer Science13, 45\u201360 (1981).","journal-title":"Theoretical Computer Science"},{"key":"BF02254849_CR25","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1137\/0207020","volume":"7","author":"E. Reghbati","year":"1978","unstructured":"Reghbati, E. (Arjomandi), Corneil, D. G.: Parallel computations in graph theory. SIAM J. Computing7, 230\u2013236 (1978).","journal-title":"SIAM J. Computing"},{"key":"BF02254849_CR26","unstructured":"Savage, C.: Parallel algorithms for graph theoretical problems. Doctoral Thesis, Mathematics Department, University of Illinois at Urbana-Champaign, August 1977, Report ACT-4, Coordinated Science Laboratory, University of Illinois."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02254849.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02254849\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02254849","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T03:54:36Z","timestamp":1586577276000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02254849"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,3]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,3]]}},"alternative-id":["BF02254849"],"URL":"https:\/\/doi.org\/10.1007\/bf02254849","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,3]]}}}