{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T15:37:30Z","timestamp":1648568250820},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,11,1]],"date-time":"1993-11-01T00:00:00Z","timestamp":752112000000},"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":7198,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1993,11]]},"DOI":"10.1016\/0304-3975(93)90291-z","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"261-278","source":"Crossref","is-referenced-by-count":0,"title":["An optimal distributed algorithm for recognizing mesh-connected networks"],"prefix":"10.1016","volume":"120","author":[{"given":"Rajanarayanan","family":"Subbiah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sitharama S.","family":"Iyengar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sridhar","family":"Radhakrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.L.","family":"Kashyap","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90291-Z_BIB1","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1145\/4221.4227","article-title":"An efficient network synchronization protocol","volume":"32","author":"Awerbuch","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(93)90291-Z_BIB2","first-page":"230","article-title":"Optimal distributed algorithms for minimum weight spanning trees, counting, leader election and related problems","author":"Awerbuch","year":"1987","journal-title":"Proc. Symp. on Theory of Computation"},{"key":"10.1016\/0304-3975(93)90291-Z_BIB3","first-page":"250","article-title":"Distributed BFS algorithm","author":"Awerbuch","year":"1985","journal-title":"IEEE Found. Comput. Theory"},{"key":"10.1016\/0304-3975(93)90291-Z_BIB4","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1145\/358690.358717","article-title":"Distributed computation on graphs: shortest path algorithms","volume":"25","author":"Chandy","year":"1982","journal-title":"CACM"},{"key":"10.1016\/0304-3975(93)90291-Z_BIB5","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1109\/TSE.1982.235573","article-title":"Echo algorithms: depth parallel operations on general graphs","volume":"SE-9","author":"Chang","year":"1982","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0304-3975(93)90291-Z_BIB6","doi-asserted-by":"crossref","first-page":"898","DOI":"10.1109\/TC.1982.1676107","article-title":"A distributed algorithm for shortest paths","volume":"C31","author":"Chen","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(93)90291-Z_BIB7","article-title":"A single source shortest path algorithm for a planar distributed network","author":"Frederickson","year":"1985","journal-title":"Proc. Sympos. Theoret. Aspects Comput. Sci."},{"key":"10.1016\/0304-3975(93)90291-Z_BIB8","series-title":"Tech. Report, LIDS-P-1175","article-title":"Distributed minimum hop algorithms","author":"Gallager","year":"1982"},{"key":"10.1016\/0304-3975(93)90291-Z_BIB9","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 TOPLAS"},{"key":"10.1016\/0304-3975(93)90291-Z_BIB10","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1145\/579.585","article-title":"Distributed algorithms for finding centers and medians in networks","volume":"6","author":"Korach","year":"1984","journal-title":"ACM TOPLAS"},{"key":"10.1016\/0304-3975(93)90291-Z_BIB11","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1145\/69622.357190","article-title":"A distributed graph algorithm: knot detection","volume":"4","author":"Misra","year":"1982","journal-title":"ACM TOPLAS"},{"key":"10.1016\/0304-3975(93)90291-Z_BIB12","series-title":"Ph.D. Dissertation","article-title":"Efficient distributed algorithms for network facility problems","author":"Mohan","year":"1990"},{"key":"10.1016\/0304-3975(93)90291-Z_BIB13","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0020-0190(89)90041-0","article-title":"An efficient distributed depth-first-search algorithm","volume":"32","author":"Mohan","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(93)90291-Z_BIB14","article-title":"Adaptive distributed minimal spanning tree algorithms","author":"Parker","year":"1981","journal-title":"Proc. 1st Symp. Reliability Distrib. Software Databases"},{"key":"10.1016\/0304-3975(93)90291-Z_BIB15","doi-asserted-by":"crossref","DOI":"10.1109\/12.29464","article-title":"Distributed algorithms for network recognition problems","volume":"38","author":"Ramarao","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(93)90291-Z_BIB16","unstructured":"K.V.S. Ramarao and S. Venkatesan, On finding and updating shortest paths distributively, in: Proc. 24th Allerton 1986 Conf.; J. Algorithms, to appear."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390291Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390291Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:25:03Z","timestamp":1555129503000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759390291Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,11]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,11]]}},"alternative-id":["030439759390291Z"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90291-z","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,11]]}}}