{"id":"https://openalex.org/W1571815623","doi":"https://doi.org/10.1007/978-3-540-69507-3_21","title":"Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs","display_name":"Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W1571815623","doi":"https://doi.org/10.1007/978-3-540-69507-3_21","mag":"1571815623"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-69507-3_21","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-69507-3_21","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5012478271","display_name":"Miroslaw Dynia","orcid":null},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Miroslaw Dynia","raw_affiliation_strings":["DFG Graduate College \u201cAutomatic Configuration in Open Systems\u201d, Heinz Nixdorf Institute, University of Paderborn, Germany","DFG Graduate College Automatic Configuration in Open Systems, Heinz Nixdorf Institute, University of Paderborn, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"DFG Graduate College \u201cAutomatic Configuration in Open Systems\u201d, Heinz Nixdorf Institute, University of Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]},{"raw_affiliation_string":"DFG Graduate College Automatic Configuration in Open Systems, Heinz Nixdorf Institute, University of Paderborn, Germany#TAB#","institution_ids":["https://openalex.org/I206945453"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111909754","display_name":"Miroslaw Korzeniowski","orcid":null},"institutions":[{"id":"https://openalex.org/I4210160189","display_name":"Institut Polytechnique de Bordeaux","ror":"https://ror.org/054qv7y42","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210160189"]},{"id":"https://openalex.org/I219388962","display_name":"University of Wroc\u0142aw","ror":"https://ror.org/00yae6e25","country_code":"PL","type":"education","lineage":["https://openalex.org/I219388962"]},{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]},{"id":"https://openalex.org/I4210087266","display_name":"Institute of Computer Science","ror":"https://ror.org/003fvp964","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210087266","https://openalex.org/I99542240"]}],"countries":["FR","PL"],"is_corresponding":false,"raw_author_name":"Miroslaw Korzeniowski","raw_affiliation_strings":["Institute of Computer Science, University of Wroclaw, Poland and, LaBRI \u2013 INRIA Futurs, Bordeaux, France","Institute of Computer Science, University of Wroclaw, Poland and, LaBRI --- INRIA Futurs, Bordeaux, France"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Wroclaw, Poland and, LaBRI \u2013 INRIA Futurs, Bordeaux, France","institution_ids":["https://openalex.org/I4210087266","https://openalex.org/I219388962","https://openalex.org/I1326498283","https://openalex.org/I15057530","https://openalex.org/I4210160189","https://openalex.org/I4210142254"]},{"raw_affiliation_string":"Institute of Computer Science, University of Wroclaw, Poland and, LaBRI --- INRIA Futurs, Bordeaux, France","institution_ids":["https://openalex.org/I219388962","https://openalex.org/I4210142254"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082927661","display_name":"Jaros\u0142aw Kuty\u0142owski","orcid":null},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jaros\u0142aw Kuty\u0142owski","raw_affiliation_strings":["International Graduate School of Dynamic Intelligent Systems, Heinz Nixdorf Institute, University of Paderborn, Germany"],"affiliations":[{"raw_affiliation_string":"International Graduate School of Dynamic Intelligent Systems, Heinz Nixdorf Institute, University of Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5012478271"],"corresponding_institution_ids":["https://openalex.org/I206945453"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.4172,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.63733162,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"260","last_page":"271"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987000226974487,"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.9980999827384949,"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/spanning-tree","display_name":"Spanning tree","score":0.8426471948623657},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7946490049362183},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.760489821434021},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5997056365013123},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.5787397623062134},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.5101869106292725},{"id":"https://openalex.org/keywords/reverse-delete-algorithm","display_name":"Reverse-delete algorithm","score":0.49261242151260376},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.4869166612625122},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.47351837158203125},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.47024884819984436},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47001102566719055},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.4251026511192322},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.4193309545516968},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3960157036781311},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.21974486112594604},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.1695689558982849},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.05775350332260132}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8426471948623657},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7946490049362183},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.760489821434021},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5997056365013123},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.5787397623062134},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.5101869106292725},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.49261242151260376},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.4869166612625122},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.47351837158203125},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.47024884819984436},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47001102566719055},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.4251026511192322},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4193309545516968},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3960157036781311},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.21974486112594604},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.1695689558982849},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.05775350332260132}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-540-69507-3_21","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-69507-3_21","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W594463866","https://openalex.org/W1552092932","https://openalex.org/W1552828154","https://openalex.org/W1589421353","https://openalex.org/W1928375144","https://openalex.org/W1965525854","https://openalex.org/W1965680834","https://openalex.org/W1969406444","https://openalex.org/W2009695707","https://openalex.org/W2017927472","https://openalex.org/W2032841680","https://openalex.org/W2049596277","https://openalex.org/W2110103944","https://openalex.org/W2112183601","https://openalex.org/W2127280340","https://openalex.org/W2128744826","https://openalex.org/W2128865241","https://openalex.org/W2158637188","https://openalex.org/W2160907067","https://openalex.org/W4248275387","https://openalex.org/W4255306344"],"related_works":["https://openalex.org/W2943635264","https://openalex.org/W1587959445","https://openalex.org/W3081212354","https://openalex.org/W1576317141","https://openalex.org/W2911818503","https://openalex.org/W3010374802","https://openalex.org/W2130375301","https://openalex.org/W1968569027","https://openalex.org/W2010585027","https://openalex.org/W1516991388"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}