{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T02:03:25Z","timestamp":1648778605215},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,6,1]],"date-time":"1990-06-01T00:00:00Z","timestamp":644198400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8447,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1990,6]]},"DOI":"10.1016\/0890-5401(90)90051-i","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T15:34:26Z","timestamp":1103211266000},"page":"140-159","source":"Crossref","is-referenced-by-count":5,"title":["A distributed shortest path algorithm for a planar network"],"prefix":"10.1016","volume":"86","author":[{"given":"Greg N.","family":"Frederickson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(90)90051-I_BIB1","series-title":"Proceedings, 16th Allerton Conf. on Comm., Control and Computing","first-page":"271","article-title":"A decentralized shortest path algorithm","author":"Abram","year":"1978"},{"key":"10.1016\/0890-5401(90)90051-I_BIB2","series-title":"Proceedings, 21st ACM Symp. on Theory of Computing","first-page":"490","article-title":"Distributed shortest paths algorithms","author":"Awerbuch","year":"1989"},{"key":"10.1016\/0890-5401(90)90051-I_BIB3","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1109\/TIT.1987.1057314","article-title":"A new distributed algorithm to find breadth first search trees","volume":"33","author":"Awerbuch","year":"1987","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0890-5401(90)90051-I_BIB4","series-title":"Proceedings, 26th IEEE Symp. on Foundations of Computer Science","first-page":"250","article-title":"Distributed BFS algorithms","author":"Awerbuch","year":"1985"},{"key":"10.1016\/0890-5401(90)90051-I_BIB5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connexion with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"key":"10.1016\/0890-5401(90)90051-I_BIB6","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.1137\/0216064","article-title":"Fast algorithms for shortest paths in planar graphs, with applications","volume":"16","author":"Frederickson","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(90)90051-I_BIB7","series-title":"Proceedings, 2nd Symp. on Theoretical Aspects of Computer Science","first-page":"143","article-title":"A single source shortest path algorithm for a planar distributed network","author":"Frederickson","year":"1985"},{"key":"10.1016\/0890-5401(90)90051-I_BIB8","author":"Friedman","year":"1979"},{"key":"10.1016\/0890-5401(90)90051-I_BIB9","article-title":"Distributed minimum hop algorithms","author":"Gallager","year":"1982","journal-title":"MIT Technical Report LIDS-P-1175"},{"issue":"No. 1","key":"10.1016\/0890-5401(90)90051-I_BIB10","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/357195.357200","article-title":"A distributed algorithm for minimum weight spanning trees","volume":"5","author":"Gallager","year":"1983","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"10.1016\/0890-5401(90)90051-I_BIB11","author":"Harary","year":"1969"},{"issue":"No. 1","key":"10.1016\/0890-5401(90)90051-I_BIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321992.321993","article-title":"Efficient algorithms for shortest paths in sparse networks","volume":"24","author":"Johnson","year":"1977","journal-title":"J. Assoc. Comput. Mach."},{"issue":"No. 2","key":"10.1016\/0890-5401(90)90051-I_BIB13","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/0136016","article-title":"A separator theorem for planar graphs","volume":"36","author":"Lipton","year":"1979","journal-title":"SIAM J. Appl. Math."},{"issue":"No. 2","key":"10.1016\/0890-5401(90)90051-I_BIB14","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1137\/0209046","article-title":"Applications of a planar separator theorem","volume":"9","author":"Lipton","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(90)90051-I_BIB15","author":"Toueg","year":"1980"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019090051I?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019090051I?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T20:25:56Z","timestamp":1548879956000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019090051I"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,6]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,6]]}},"alternative-id":["089054019090051I"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(90)90051-i","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1990,6]]}}}