{"id":"https://openalex.org/W2032808930","doi":"https://doi.org/10.1137/090745441","title":"A Tight Upper Bound on the Probabilistic Embedding of Series-Parallel Graphs","display_name":"A Tight Upper Bound on the Probabilistic Embedding of Series-Parallel Graphs","publication_year":2009,"publication_date":"2009-12-09","ids":{"openalex":"https://openalex.org/W2032808930","doi":"https://doi.org/10.1137/090745441","mag":"2032808930"},"language":"en","primary_location":{"id":"doi:10.1137/090745441","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090745441","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","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/A5000264005","display_name":"Yuval Emek","orcid":"https://orcid.org/0000-0002-3123-3451"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yuval Emek","raw_affiliation_strings":["[email\u00a0protected]#TAB#"],"affiliations":[{"raw_affiliation_string":"[email\u00a0protected]#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056419022","display_name":"David Peleg","orcid":"https://orcid.org/0000-0003-1590-0506"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David Peleg","raw_affiliation_strings":["[email\u00a0protected]#TAB#"],"affiliations":[{"raw_affiliation_string":"[email\u00a0protected]#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5000264005"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.10821297,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"23","issue":"4","first_page":"1827","last_page":"1841"},"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.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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8039062023162842},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7883062362670898},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.648223876953125},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5954723358154297},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5183047652244568},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5095170140266418},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.4968319237232208},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.48800531029701233},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4761754870414734},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.4627964496612549},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.44867774844169617},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44585466384887695},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.43820852041244507},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.43328607082366943},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3871498703956604},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.25418901443481445},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.1287778913974762},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.11430302262306213},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.08739757537841797}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8039062023162842},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7883062362670898},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.648223876953125},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5954723358154297},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5183047652244568},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5095170140266418},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.4968319237232208},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.48800531029701233},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4761754870414734},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.4627964496612549},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.44867774844169617},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44585466384887695},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.43820852041244507},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.43328607082366943},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3871498703956604},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.25418901443481445},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.1287778913974762},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.11430302262306213},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.08739757537841797},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/090745441","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090745441","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.1018.1116","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1018.1116","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ce.sharif.ac.ir/%7Eghodsi/archive/d-papers/ACM%20SODA/2006/A%20Tight%20Upper%20Bound%20on%20the%20Probabilistic%20Embedding%20of%20Series-Parallel%20Graphs.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.104.9908","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.104.9908","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.wisdom.weizmann.ac.il/~yuvale/Publications/tight-bound.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.524.7752","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.524.7752","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eng.tau.ac.il/~yuvale/Publications/tight-bound.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":23,"referenced_works":["https://openalex.org/W48861618","https://openalex.org/W1518157041","https://openalex.org/W1952648253","https://openalex.org/W1967520142","https://openalex.org/W1973297532","https://openalex.org/W1981859328","https://openalex.org/W1985495277","https://openalex.org/W2005191532","https://openalex.org/W2016218947","https://openalex.org/W2018128607","https://openalex.org/W2032684479","https://openalex.org/W2041571997","https://openalex.org/W2042899161","https://openalex.org/W2047517090","https://openalex.org/W2068871408","https://openalex.org/W2082353536","https://openalex.org/W2107711372","https://openalex.org/W2114493937","https://openalex.org/W2149272173","https://openalex.org/W2312856063","https://openalex.org/W2569942321","https://openalex.org/W3030774092","https://openalex.org/W3138832177"],"related_works":["https://openalex.org/W4308416203","https://openalex.org/W1985149601","https://openalex.org/W1964611452","https://openalex.org/W2943635264","https://openalex.org/W2048177396","https://openalex.org/W620960161","https://openalex.org/W1971863547","https://openalex.org/W2084694919","https://openalex.org/W2149927264","https://openalex.org/W3099328339"],"abstract_inverted_index":{"We":[0],"prove":[1],"that":[2,64,108],"every":[3],"unweighted":[4],"series-parallel":[5,94],"graph":[6,45,95],"can":[7,75],"be":[8,76],"probabilistically":[9,40],"embedded":[10],"into":[11,46],"its":[12],"spanning":[13,66,88],"trees":[14,67],"with":[15,68],"logarithmic":[16],"distortion.":[17],"This":[18,72],"is":[19,55,100],"tight":[20],"due":[21],"to":[22,39,78],"an":[23],"$\\Omega(\\log":[24],"n)$":[25,104],"lower":[26],"bound":[27,54],"established":[28],"by":[29,57],"Gupta,":[30],"Newman,":[31],"Rabinovich,":[32],"and":[33],"Sinclair":[34],"on":[35],"the":[36,42],"distortion":[37],"required":[38],"embed":[41],"n-vertex":[43],"diamond":[44],"a":[47,59,80,87,91],"collection":[48],"of":[49,90,109],"dominating":[50],"trees.":[51],"Our":[52],"upper":[53],"gained":[56],"presenting":[58],"polynomial":[60,82],"time":[61,83],"probabilistic":[62,73],"algorithm":[63,74,84],"constructs":[65],"low":[69],"expected":[70],"stretch.":[71],"derandomized":[77],"yield":[79],"deterministic":[81],"for":[85],"constructing":[86],"tree":[89],"given":[92],"(unweighted)":[93],"G,":[96],"whose":[97],"communication":[98],"cost":[99],"at":[101],"most":[102],"$O(\\log":[103],"times":[105],"larger":[106],"than":[107],"G.":[110]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2014,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}