{"id":"https://openalex.org/W2082151635","doi":"https://doi.org/10.1016/0020-0190(96)00102-0","title":"An efficient distributed algorithm for centering a spanning tree of a biconnected graph","display_name":"An efficient distributed algorithm for centering a spanning tree of a biconnected graph","publication_year":1996,"publication_date":"1996-08-01","ids":{"openalex":"https://openalex.org/W2082151635","doi":"https://doi.org/10.1016/0020-0190(96)00102-0","mag":"2082151635"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(96)00102-0","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0020-0190(96)00102-0","pdf_url":"https://www.sciencedirect.com/science/article/pii/0020019096001020/pdf","source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.sciencedirect.com/science/article/pii/0020019096001020/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109036747","display_name":"R. F. M. Aranha","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"R.F.M. Aranha","raw_affiliation_strings":["Department of Computer Science, Stanford University, Stanford, CA 94305, USA","Department of Computer Science, Stanford University, Stanford CA 94305, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Stanford University, Stanford, CA 94305, USA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Department of Computer Science, Stanford University, Stanford CA 94305, USA#TAB#","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103487617","display_name":"C. Pandu Rangan","orcid":null},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"education","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"C.Pandu Rangan","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology, Madras 600 036, India","Department of Computer Science and Engineering, Indian Institute of Technology, Madras-600 036, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology, Madras 600 036, India","institution_ids":["https://openalex.org/I24676775"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology, Madras-600 036, India","institution_ids":["https://openalex.org/I24676775"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5109036747"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":{"value":2040,"currency":"USD","value_usd":2040},"apc_paid":{"value":2040,"currency":"USD","value_usd":2040},"fwci":0.5688,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.75218659,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"59","issue":"3","first_page":"145","last_page":"150"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/biconnected-graph","display_name":"Biconnected graph","score":0.8532140851020813},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7694157361984253},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6610522270202637},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6090982556343079},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5790845155715942},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4907911717891693},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4381789267063141},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.43554815649986267},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4278584420681},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.4174345135688782},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.13029900193214417},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.09411630034446716}],"concepts":[{"id":"https://openalex.org/C45725084","wikidata":"https://www.wikidata.org/wiki/Q4390447","display_name":"Biconnected graph","level":5,"score":0.8532140851020813},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7694157361984253},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6610522270202637},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6090982556343079},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5790845155715942},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4907911717891693},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4381789267063141},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.43554815649986267},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4278584420681},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.4174345135688782},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.13029900193214417},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.09411630034446716}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0020-0190(96)00102-0","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0020-0190(96)00102-0","pdf_url":"https://www.sciencedirect.com/science/article/pii/0020019096001020/pdf","source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/0020-0190(96)00102-0","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0020-0190(96)00102-0","pdf_url":"https://www.sciencedirect.com/science/article/pii/0020019096001020/pdf","source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2082151635.pdf","grobid_xml":"https://content.openalex.org/works/W2082151635.grobid-xml"},"referenced_works_count":8,"referenced_works":["https://openalex.org/W1502972029","https://openalex.org/W1513982482","https://openalex.org/W1966734270","https://openalex.org/W1978594916","https://openalex.org/W2091252880","https://openalex.org/W2340365916","https://openalex.org/W4292003140","https://openalex.org/W6629869971"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W2138987445","https://openalex.org/W2943635264","https://openalex.org/W2387385213","https://openalex.org/W2357347008","https://openalex.org/W4302939663","https://openalex.org/W2418231958","https://openalex.org/W4242086819","https://openalex.org/W1842018596","https://openalex.org/W2069230977"],"abstract_inverted_index":{"Given":[0],"a":[1,11,17,23,55,59],"biconnected":[2,60],"graph":[3],"G":[4,28],"with":[5,29],"n":[6],"vertices,":[7],"m":[8],"edges":[9],"and":[10,47],"vertex":[12,32],"r,":[13],"the":[14,30],"centering":[15,54],"of":[16,27,36,58],"spanning":[18,24,56],"tree":[19,25,57],"problem":[20],"asks":[21],"for":[22,53],"T":[26],"given":[31],"r":[33],"as":[34],"center":[35],"T.":[37],"In":[38],"this":[39],"paper":[40],"we":[41],"present":[42],"an":[43],"O(m)":[44],"message":[45],"complexity":[46,50],"O(n)":[48],"time":[49],"distributed":[51],"algorithm":[52],"graph.":[61]},"counts_by_year":[],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}