{"id":"https://openalex.org/W1851183885","doi":"https://doi.org/10.1007/978-3-642-35843-2_18","title":"Collective Additive Tree Spanners of Bounded Tree-Breadth Graphs with Generalizations and Consequences","display_name":"Collective Additive Tree Spanners of Bounded Tree-Breadth Graphs with Generalizations and Consequences","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W1851183885","doi":"https://doi.org/10.1007/978-3-642-35843-2_18","mag":"1851183885"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-35843-2_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-35843-2_18","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/A5086851146","display_name":"Feodor F. Dragan","orcid":null},"institutions":[{"id":"https://openalex.org/I149910238","display_name":"Kent State University","ror":"https://ror.org/049pfb863","country_code":"US","type":"education","lineage":["https://openalex.org/I149910238"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Feodor F. Dragan","raw_affiliation_strings":["Department of Computer Science, Kent State University, Kent, OH, 44242, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Kent State University, Kent, OH, 44242, USA","institution_ids":["https://openalex.org/I149910238"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028225596","display_name":"Muad Abu\u2010Ata","orcid":null},"institutions":[{"id":"https://openalex.org/I149910238","display_name":"Kent State University","ror":"https://ror.org/049pfb863","country_code":"US","type":"education","lineage":["https://openalex.org/I149910238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Muad Abu-Ata","raw_affiliation_strings":["Department of Computer Science, Kent State University, Kent, OH, 44242, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Kent State University, Kent, OH, 44242, USA","institution_ids":["https://openalex.org/I149910238"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5086851146"],"corresponding_institution_ids":["https://openalex.org/I149910238"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.2345,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.79529272,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"194","last_page":"206"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9986000061035156,"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/combinatorics","display_name":"Combinatorics","score":0.7448530197143555},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.7103263735771179},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.6817018985748291},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6243867874145508},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.5993250608444214},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5723600387573242},{"id":"https://openalex.org/keywords/spanner","display_name":"Spanner","score":0.5521308183670044},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5372580885887146},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.5221079587936401},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.48993510007858276},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47463592886924744},{"id":"https://openalex.org/keywords/tr\u00e9maux-tree","display_name":"Tr\u00e9maux tree","score":0.4663397967815399},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4225071966648102},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4111272692680359},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4107334315776825},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24585354328155518},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.23872852325439453},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.14042863249778748},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11521050333976746},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.10451579093933105}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7448530197143555},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.7103263735771179},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.6817018985748291},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6243867874145508},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.5993250608444214},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5723600387573242},{"id":"https://openalex.org/C2779585601","wikidata":"https://www.wikidata.org/wiki/Q4049850","display_name":"Spanner","level":2,"score":0.5521308183670044},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5372580885887146},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.5221079587936401},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.48993510007858276},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47463592886924744},{"id":"https://openalex.org/C124302570","wikidata":"https://www.wikidata.org/wiki/Q7849146","display_name":"Tr\u00e9maux tree","level":5,"score":0.4663397967815399},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4225071966648102},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4111272692680359},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4107334315776825},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24585354328155518},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.23872852325439453},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.14042863249778748},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11521050333976746},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.10451579093933105},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-35843-2_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-35843-2_18","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W7577026","https://openalex.org/W1483187268","https://openalex.org/W1550952795","https://openalex.org/W1851183885","https://openalex.org/W1860059046","https://openalex.org/W1952648253","https://openalex.org/W1980453887","https://openalex.org/W1980466385","https://openalex.org/W1980831620","https://openalex.org/W1985209733","https://openalex.org/W1995114081","https://openalex.org/W2000950178","https://openalex.org/W2016638039","https://openalex.org/W2018963243","https://openalex.org/W2021932455","https://openalex.org/W2029448190","https://openalex.org/W2044989918","https://openalex.org/W2093095561","https://openalex.org/W2114493937","https://openalex.org/W2125082389","https://openalex.org/W2126464568","https://openalex.org/W2139391136","https://openalex.org/W2161029651","https://openalex.org/W2477674116","https://openalex.org/W2569942321","https://openalex.org/W2912257407","https://openalex.org/W3030774092","https://openalex.org/W4245082111"],"related_works":["https://openalex.org/W1536968248","https://openalex.org/W1860059046","https://openalex.org/W1545960079","https://openalex.org/W2012939398","https://openalex.org/W2369260439","https://openalex.org/W2126464568","https://openalex.org/W1851183885","https://openalex.org/W2011473626","https://openalex.org/W4299621178","https://openalex.org/W2951431831"],"abstract_inverted_index":null,"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}