{"id":"https://openalex.org/W2147150816","doi":"https://doi.org/10.1007/bf01944354","title":"Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree","display_name":"Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree","publication_year":1996,"publication_date":"1996-12-01","ids":{"openalex":"https://openalex.org/W2147150816","doi":"https://doi.org/10.1007/bf01944354","mag":"2147150816"},"language":"en","primary_location":{"id":"doi:10.1007/bf01944354","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01944354","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103328212","display_name":"D. Barton Johnson","orcid":null},"institutions":[{"id":"https://openalex.org/I107672454","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22","country_code":"US","type":"education","lineage":["https://openalex.org/I107672454"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"D. B. Johnson","raw_affiliation_strings":["Sudikoff Laboratory for Computer Science, Dartmouth College, 03755-3551, Hanover, NH, USA","Sudikoff Laboratory for Computer Science, Dartmouth College, Hanover, USA"],"affiliations":[{"raw_affiliation_string":"Sudikoff Laboratory for Computer Science, Dartmouth College, 03755-3551, Hanover, NH, USA","institution_ids":["https://openalex.org/I107672454"]},{"raw_affiliation_string":"Sudikoff Laboratory for Computer Science, Dartmouth College, Hanover, USA","institution_ids":["https://openalex.org/I107672454"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001125856","display_name":"Panagiotis Metaxas","orcid":"https://orcid.org/0000-0002-5539-783X"},"institutions":[{"id":"https://openalex.org/I189731429","display_name":"Wellesley College","ror":"https://ror.org/01srpnj69","country_code":"US","type":"education","lineage":["https://openalex.org/I189731429"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"P. Metaxas","raw_affiliation_strings":["Department of Computer Science, Wellesley College, 02181-8289, Wellesley, MA, USA","Department of Computer Science, Wellesley College, Wellesley, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Wellesley College, 02181-8289, Wellesley, MA, USA","institution_ids":["https://openalex.org/I189731429"]},{"raw_affiliation_string":"Department of Computer Science, Wellesley College, Wellesley, USA","institution_ids":["https://openalex.org/I189731429"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103328212"],"corresponding_institution_ids":["https://openalex.org/I107672454"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.5153,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.69269521,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"16","issue":"6","first_page":"633","last_page":"648"},"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.9986000061035156,"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.9986000061035156,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.994700014591217,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6957783102989197},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.659898042678833},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6253958940505981},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5850319266319275},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5403973460197449},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5018825531005859},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4839356541633606},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4538409411907196},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.41197049617767334},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33252501487731934},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.23653259873390198}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6957783102989197},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.659898042678833},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6253958940505981},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5850319266319275},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5403973460197449},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5018825531005859},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4839356541633606},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4538409411907196},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.41197049617767334},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33252501487731934},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.23653259873390198},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/bf01944354","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01944354","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:repository.wellesley.edu:computersciencefaculty-1005","is_oa":false,"landing_page_url":"https://repository.wellesley.edu/cgi/viewcontent.cgi?article=1005&context=computersciencefaculty","pdf_url":null,"source":{"id":"https://openalex.org/S4377196571","display_name":"Wellesley College Digital RepositoryWellesley (Wellesley College)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I189731429","host_organization_name":"Wellesley College","host_organization_lineage":["https://openalex.org/I189731429"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Science Faculty Scholarship","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.55.56","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.56","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.wellesley.edu/CS/pmetaxas/algor.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.903.2926","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.903.2926","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://repository.wellesley.edu/cgi/viewcontent.cgi?article%3D1005%26context%3Dcomputersciencefaculty","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W135887360","https://openalex.org/W188468998","https://openalex.org/W619004858","https://openalex.org/W1503004197","https://openalex.org/W1513400187","https://openalex.org/W1519160786","https://openalex.org/W1523679426","https://openalex.org/W1532566247","https://openalex.org/W1580560707","https://openalex.org/W1965874601","https://openalex.org/W1973566062","https://openalex.org/W1995040285","https://openalex.org/W2013781411","https://openalex.org/W2034282023","https://openalex.org/W2038176627","https://openalex.org/W2039895055","https://openalex.org/W2049247788","https://openalex.org/W2065634943","https://openalex.org/W2069446854","https://openalex.org/W2070570981","https://openalex.org/W2071845176","https://openalex.org/W2080566336","https://openalex.org/W2081385108","https://openalex.org/W2103512074","https://openalex.org/W2130566259","https://openalex.org/W2132750992","https://openalex.org/W2160907067","https://openalex.org/W2169155148","https://openalex.org/W2395933225","https://openalex.org/W6634962901"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W2099915933","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W4380840098","https://openalex.org/W2044443696","https://openalex.org/W2503538928","https://openalex.org/W2390742649","https://openalex.org/W3101281637","https://openalex.org/W1561849181"],"abstract_inverted_index":null,"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}