{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:34:41Z","timestamp":1757615681940,"version":"3.44.0"},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2000,2,20]],"date-time":"2000-02-20T00:00:00Z","timestamp":951004800000},"content-version":"vor","delay-in-days":1298,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1996,8]]},"DOI":"10.1016\/0020-0190(96)00102-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:21:21Z","timestamp":1027606881000},"page":"145-150","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["An efficient distributed algorithm for centering a spanning tree of a biconnected graph"],"prefix":"10.1016","volume":"59","author":[{"given":"R.F.M.","family":"Aranha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.Pandu","family":"Rangan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(96)00102-0_BIB1","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0020-0190(89)90051-3","article-title":"Centering a spanning tree of a biconnected graph","volume":"32","author":"Cheston","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(96)00102-0_BIB2","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0304-3975(76)90086-4","article-title":"Computing an st-numbering","volume":"2","author":"Even","year":"1976","journal-title":"Theoret. Comput. Sci."},{"year":"1979","author":"Even","series-title":"Graph Algorithms","key":"10.1016\/0020-0190(96)00102-0_BIB3"},{"key":"10.1016\/0020-0190(96)00102-0_BIB4","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0190(94)00066-2","article-title":"A linear algorithm for centering a spanning tree of a biconnected graph","volume":"51","author":"Easwarakumar","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(96)00102-0_BIB5","first-page":"633","article-title":"An efficient distributed algorithm for st-numbering the vertices of a biconnected graph","volume":"1","author":"Aranha","year":"1994","journal-title":"J. Universal Comput. Sci."},{"key":"10.1016\/0020-0190(96)00102-0_BIB6","series-title":"Synthesis of Parallel Algorithms","first-page":"275","article-title":"Parallel open ear decomposition with applications to graph biconnectivity and triconnectivity","author":"Ramachandran","year":"1993"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096001020?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096001020?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T14:58:33Z","timestamp":1757084313000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019096001020"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["0020019096001020"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(96)00102-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[1996,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An efficient distributed algorithm for centering a spanning tree of a biconnected graph","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0020-0190(96)00102-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1996 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}