{"id":"https://openalex.org/W2072142932","doi":"https://doi.org/10.1145/2213977.2214015","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":2012,"publication_date":"2012-05-19","ids":{"openalex":"https://openalex.org/W2072142932","doi":"https://doi.org/10.1145/2213977.2214015","mag":"2072142932"},"language":"en","primary_location":{"id":"doi:10.1145/2213977.2214015","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2213977.2214015","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-fourth annual ACM symposium on Theory of computing","raw_type":"proceedings-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":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ittai Abraham","raw_affiliation_strings":["Microsoft Research SVC, Mountain View, CA, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research SVC, Mountain View, CA, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066182501","display_name":"Ofer Neiman","orcid":"https://orcid.org/0000-0003-4179-4364"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Ofer Neiman","raw_affiliation_strings":["Ben Gurion University of the Negev, Beer Sheva, Israel"],"affiliations":[{"raw_affiliation_string":"Ben Gurion University of the Negev, Beer Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5078682514"],"corresponding_institution_ids":["https://openalex.org/I1290206253"],"apc_list":null,"apc_paid":null,"fwci":11.4219,"has_fulltext":false,"cited_by_count":98,"citation_normalized_percentile":{"value":0.98974535,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"395","last_page":"406"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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.9994999766349792,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9991000294685364,"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/T10720","display_name":"Complexity and Algorithms in Graphs","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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7627122402191162},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7493054866790771},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6904950737953186},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5918225049972534},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5363631844520569},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.522075355052948},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5186933279037476},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.47306668758392334},{"id":"https://openalex.org/keywords/radius","display_name":"RADIUS","score":0.4654316306114197},{"id":"https://openalex.org/keywords/cluster","display_name":"Cluster (spacecraft)","score":0.44288355112075806},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.26167386770248413}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7627122402191162},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7493054866790771},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6904950737953186},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5918225049972534},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5363631844520569},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.522075355052948},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5186933279037476},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.47306668758392334},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.4654316306114197},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.44288355112075806},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26167386770248413},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2213977.2214015","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2213977.2214015","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-fourth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.722.8949","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.722.8949","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bgu.ac.il/%7Eneimano/spanning-full1.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.723.2897","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.723.2897","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bgu.ac.il/%7Eneimano/spanning-camera2.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1576928406","https://openalex.org/W1967520142","https://openalex.org/W1978086920","https://openalex.org/W1981859328","https://openalex.org/W2009861473","https://openalex.org/W2016332468","https://openalex.org/W2040831377","https://openalex.org/W2041571997","https://openalex.org/W2045107949","https://openalex.org/W2058332489","https://openalex.org/W2059063102","https://openalex.org/W2079566953","https://openalex.org/W2082353536","https://openalex.org/W2095941092","https://openalex.org/W2102560346","https://openalex.org/W2114493937","https://openalex.org/W2125664420","https://openalex.org/W2132452995","https://openalex.org/W2149272173","https://openalex.org/W2153441719","https://openalex.org/W2164853353","https://openalex.org/W2949556662","https://openalex.org/W3022612511","https://openalex.org/W4237850333"],"related_works":["https://openalex.org/W3099328339","https://openalex.org/W2099915933","https://openalex.org/W2149927264","https://openalex.org/W4308416203","https://openalex.org/W2803918337","https://openalex.org/W2082872574","https://openalex.org/W2015718828","https://openalex.org/W3141326665","https://openalex.org/W2047517090","https://openalex.org/W2350799039"],"abstract_inverted_index":{"We":[0],"prove":[1],"that":[2,18,54],"any":[3],"graph":[4],"G=(V,E)":[5],"with":[6],"n":[7,24,39],"points":[8],"and":[9],"m":[10],"edges":[11],"has":[12],"a":[13,30,48],"spanning":[14],"tree":[15,31,62],"T":[16],"such":[17,29],"\u2211(u,v)\u2208":[19],"E(G)dT(u,v)":[20],"=":[21],"O(m":[22,37],"log":[23,25,26,38,40,41],"n).":[27,42],"Moreover":[28],"can":[32],"be":[33],"found":[34],"in":[35,60,77],"time":[36],"Our":[43],"result":[44],"is":[45,63],"obtained":[46],"using":[47],"new":[49],"petal-decomposition":[50],"approach":[51],"which":[52],"guarantees":[53],"the":[55,61,68,71,75,78],"radius":[56,69],"of":[57,70,74],"each":[58],"cluster":[59,76],"at":[64],"most":[65],"4":[66],"times":[67],"induced":[72],"subgraph":[73],"original":[79],"graph.":[80]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":21},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":13},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}