{"id":"https://openalex.org/W2924819758","doi":"https://doi.org/10.1137/17m1115575","title":"Using Petal-Decompositions to Build a Low Stretch Spanning Tree","display_name":"Using Petal-Decompositions to Build a Low Stretch Spanning Tree","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2924819758","doi":"https://doi.org/10.1137/17m1115575","mag":"2924819758"},"language":"en","primary_location":{"id":"doi:10.1137/17m1115575","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1115575","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5078682514","display_name":"Ittai Abraham","orcid":"https://orcid.org/0000-0001-9568-7674"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ittai Abraham","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5066182501","display_name":"Ofer Neiman","orcid":"https://orcid.org/0000-0003-4179-4364"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ofer Neiman","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5078682514"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.2232,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.88799555,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"48","issue":"2","first_page":"227","last_page":"248"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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.9994999766349792,"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/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"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.8245829343795776},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.7304757833480835},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.722041130065918},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6394555568695068},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5705087184906006},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5100975632667542},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.4712187349796295},{"id":"https://openalex.org/keywords/radius","display_name":"RADIUS","score":0.4440290927886963},{"id":"https://openalex.org/keywords/cluster","display_name":"Cluster (spacecraft)","score":0.425537645816803},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.4151090681552887},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3217710852622986},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.13463425636291504}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8245829343795776},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.7304757833480835},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.722041130065918},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6394555568695068},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5705087184906006},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5100975632667542},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4712187349796295},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.4440290927886963},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.425537645816803},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.4151090681552887},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3217710852622986},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.13463425636291504},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/17m1115575","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1115575","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1981859328","https://openalex.org/W2040831377","https://openalex.org/W2047517090","https://openalex.org/W2095941092","https://openalex.org/W2295766446"],"related_works":["https://openalex.org/W2099915933","https://openalex.org/W2149927264","https://openalex.org/W4308416203","https://openalex.org/W2803918337","https://openalex.org/W2015718828","https://openalex.org/W4295683043","https://openalex.org/W3141326665","https://openalex.org/W2047517090","https://openalex.org/W2350799039","https://openalex.org/W1966931974"],"abstract_inverted_index":{"We":[0],"prove":[1],"that":[2,19,47],"any":[3],"weighted":[4],"graph":[5],"$G=(V,E,w)$":[6],"with":[7],"$n$":[8],"points":[9],"and":[10],"$m$":[11],"edges":[12],"has":[13],"a":[14,26],"spanning":[15],"tree":[16,27,55],"$T$":[17],"such":[18,25],"$\\sum_{\\{u,v\\}\\in":[20],"E}\\frac{d_T(u,v)}{w(u,v)}=O(m\\log":[21],"n\\log\\log":[22,34],"n)$.":[23,35],"Moreover,":[24],"can":[28],"be":[29],"found":[30],"in":[31,53,70],"time":[32],"$O(m\\log":[33],"Our":[36],"result":[37],"is":[38,56],"obtained":[39],"using":[40],"our":[41],"new":[42],"petal-decomposition":[43],"approach":[44],"which":[45],"guarantees":[46],"the":[48,54,61,64,68,71],"radius":[49,62],"of":[50,63,67],"each":[51],"cluster":[52,69],"at":[57],"most":[58],"four":[59],"times":[60],"induced":[65],"subgraph":[66],"original":[72],"graph.":[73]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2026-05-06T08:25:59.206177","created_date":"2025-10-10T00:00:00"}