{"id":"https://openalex.org/W1986918302","doi":"https://doi.org/10.1145/228329.228337","title":"Yet another efficient algorithm for replacing the edges of a minimum spanning tree","display_name":"Yet another efficient algorithm for replacing the edges of a minimum spanning tree","publication_year":1996,"publication_date":"1996-01-01","ids":{"openalex":"https://openalex.org/W1986918302","doi":"https://doi.org/10.1145/228329.228337","mag":"1986918302"},"language":"en","primary_location":{"id":"doi:10.1145/228329.228337","is_oa":true,"landing_page_url":"https://doi.org/10.1145/228329.228337","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/228329.228337","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 1996 ACM 24th annual conference on Computer science  - CSC '96","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/228329.228337","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054583528","display_name":"Ali A. Kooshesh","orcid":null},"institutions":[{"id":"https://openalex.org/I94339441","display_name":"Western Kentucky University","ror":"https://ror.org/0446vnd56","country_code":"US","type":"education","lineage":["https://openalex.org/I94339441"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ali A. Kooshesh","raw_affiliation_strings":["Department of Computer Science, Western Kentucky University, Bowling Green, KY","Department of Computer Science, Western Kentucky University, Bowling Green KY"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Western Kentucky University, Bowling Green, KY","institution_ids":["https://openalex.org/I94339441"]},{"raw_affiliation_string":"Department of Computer Science, Western Kentucky University, Bowling Green KY","institution_ids":["https://openalex.org/I94339441"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103702169","display_name":"Robert R. Crawford","orcid":null},"institutions":[{"id":"https://openalex.org/I94339441","display_name":"Western Kentucky University","ror":"https://ror.org/0446vnd56","country_code":"US","type":"education","lineage":["https://openalex.org/I94339441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert R. Crawford","raw_affiliation_strings":["Department of Computer Science, Western Kentucky University, Bowling Green, KY","Department of Computer Science, Western Kentucky University, Bowling Green KY"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Western Kentucky University, Bowling Green, KY","institution_ids":["https://openalex.org/I94339441"]},{"raw_affiliation_string":"Department of Computer Science, Western Kentucky University, Bowling Green KY","institution_ids":["https://openalex.org/I94339441"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5054583528"],"corresponding_institution_ids":["https://openalex.org/I94339441"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.12105589,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"76","last_page":"78"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9972000122070312,"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/citation","display_name":"Citation","score":0.6966175436973572},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6310140490531921},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.531234085559845},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.495760053396225},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48479169607162476},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4394106864929199},{"id":"https://openalex.org/keywords/world-wide-web","display_name":"World Wide Web","score":0.29356467723846436},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20436963438987732},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.09369823336601257}],"concepts":[{"id":"https://openalex.org/C2778805511","wikidata":"https://www.wikidata.org/wiki/Q1713","display_name":"Citation","level":2,"score":0.6966175436973572},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6310140490531921},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.531234085559845},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.495760053396225},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48479169607162476},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4394106864929199},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.29356467723846436},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20436963438987732},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09369823336601257}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/228329.228337","is_oa":true,"landing_page_url":"https://doi.org/10.1145/228329.228337","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/228329.228337","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 1996 ACM 24th annual conference on Computer science  - CSC '96","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/228329.228337","is_oa":true,"landing_page_url":"https://doi.org/10.1145/228329.228337","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/228329.228337","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 1996 ACM 24th annual conference on Computer science  - CSC '96","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1986918302.pdf","grobid_xml":"https://content.openalex.org/works/W1986918302.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W1965680834","https://openalex.org/W1999293689","https://openalex.org/W2008423363","https://openalex.org/W2009072875","https://openalex.org/W2011999472","https://openalex.org/W2017927472","https://openalex.org/W2023658462","https://openalex.org/W2084224084","https://openalex.org/W2160907067","https://openalex.org/W2169528473","https://openalex.org/W2753005639","https://openalex.org/W4255306344","https://openalex.org/W4285092328","https://openalex.org/W6650077526","https://openalex.org/W6656440524","https://openalex.org/W6683952395","https://openalex.org/W6685290738","https://openalex.org/W7061701222"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W2099915933","https://openalex.org/W4380840098","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W2044443696","https://openalex.org/W2503538928","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1561849181"],"abstract_inverted_index":{"Article":[0],"Free":[1],"Access":[2],"Share":[3],"on":[4,82,132],"Yet":[5],"another":[6],"efficient":[7],"algorithm":[8],"for":[9],"replacing":[10],"the":[11,76,133],"edges":[12],"of":[13,23,33,48,58,75],"a":[14,118,150],"minimum":[15],"spanning":[16],"tree":[17],"Authors:":[18],"Ali":[19],"A.":[20],"Kooshesh":[21],"Department":[22,32,47,57],"Computer":[24,34,49,59,83],"Science,":[25,35,50,60],"Western":[26,36,51,61],"Kentucky":[27,37,52,62],"University,":[28,38,53,63],"Bowling":[29,39,54,64],"Green,":[30,40,55,65],"KY":[31,56],"KYView":[41,66],"Profile":[42,67],",":[43],"Robert":[44],"R.":[45],"Crawford":[46],"Authors":[68],"Info":[69],"&":[70],"Claims":[71],"CSC":[72],"'96:":[73],"Proceedings":[74],"1996":[77,85],"ACM":[78],"24th":[79],"annual":[80],"conference":[81],"scienceFebruary":[84],"Pages":[86],"76\u201378https://doi.org/10.1145/228329.228337Online:20":[87],"February":[88],"1996Publication":[89],"History":[90],"0citation398DownloadsMetricsTotal":[91],"Citations0Total":[92],"Downloads398Last":[93],"12":[94],"Months9Last":[95],"6":[96],"weeks1":[97],"Get":[98],"Citation":[99,101,138],"AlertsNew":[100,137],"Alert":[102],"added!This":[103],"alert":[104,129],"has":[105,124],"been":[106,125],"successfully":[107],"added":[108],"and":[109],"will":[110,114],"be":[111,115],"sent":[112],"to:You":[113],"notified":[116],"whenever":[117],"record":[119],"that":[120],"you":[121],"have":[122],"chosen":[123],"cited.To":[126],"manage":[127],"your":[128,143],"preferences,":[130],"click":[131],"button":[134],"below.Manage":[135],"my":[136],"Alert!Please":[139],"log":[140],"in":[141],"to":[142,146,148],"account":[144],"Save":[145],"BinderSave":[147],"BinderCreate":[149],"New":[151],"BinderNameCancelCreateExport":[152],"CitationPublisher":[153],"SiteeReaderPDF":[154]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}