{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T04:47:02Z","timestamp":1648961222358},"reference-count":12,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1992,3,1]],"date-time":"1992-03-01T00:00:00Z","timestamp":699408000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[1992,3]]},"DOI":"10.1016\/0020-0255(92)90004-r","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T13:28:37Z","timestamp":1056979717000},"page":"41-50","source":"Crossref","is-referenced-by-count":3,"title":["Distributed processing of graphs: Fundamental cycles algorithm"],"prefix":"10.1016","volume":"60","author":[{"given":"Pranay","family":"Chaudhuri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0255(92)90004-R_BIB1","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0020-0190(85)90083-3","article-title":"A new distributed depth-first search algorithm","volume":"20","author":"Awerbuch","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0255(92)90004-R_BIB2","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-8","author":"Chang","year":"1982","journal-title":"IEEE Trans. Soft. Eng."},{"key":"10.1016\/0020-0255(92)90004-R_BIB3","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0020-0255(87)90039-9","article-title":"Algorithms for some graph problems on a distributed computational model","volume":"43","author":"Chaudhuri","year":"1987","journal-title":"Inform. Sci."},{"key":"10.1016\/0020-0255(92)90004-R_BIB4","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1080\/00207218608920823","article-title":"Distributed algorithms for analysing activity networks","volume":"60","author":"Chaudhuri","year":"1986","journal-title":"Int. J. Elect."},{"key":"10.1016\/0020-0255(92)90004-R_BIB5","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1109\/TSE.1983.234958","article-title":"Graph traversal techniques and the maximum flow problem in distributed computation","volume":"SE-9","author":"Cheung","year":"1983","journal-title":"IEEE Trans. Soft. Eng."},{"key":"10.1016\/0020-0255(92)90004-R_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(80)90021-6","article-title":"Termination detection for diffusing computation","volume":"11","author":"Dijkstra","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0255(92)90004-R_BIB7","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. Prog. Lang. Syst."},{"key":"10.1016\/0020-0255(92)90004-R_BIB8","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 Trans. Prog. Lang. Syst."},{"key":"10.1016\/0020-0255(92)90004-R_BIB9","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 Trans. Prog. Lang. Syst."},{"key":"10.1016\/0020-0255(92)90004-R_BIB10","series-title":"Combinatorial Algorithms: Theory and Practice","author":"Reingold","year":"1977"},{"key":"10.1016\/0020-0255(92)90004-R_BIB11","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1137\/0210051","article-title":"Fast, efficient parallel algorithms for some graph problems","volume":"10","author":"Savage","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0255(92)90004-R_BIB12","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1137\/0213036","article-title":"Efficient parallel algorithms for a class of graph theoretic problems","volume":"13","author":"Tsin","year":"1984","journal-title":"SIAM J. Comput."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002002559290004R?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002002559290004R?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T09:25:14Z","timestamp":1552901114000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002002559290004R"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":12,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["002002559290004R"],"URL":"https:\/\/doi.org\/10.1016\/0020-0255(92)90004-r","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}