{"id":"https://openalex.org/W2032312374","doi":"https://doi.org/10.1137/s0097539792232021","title":"Existence and Construction of Edge-Disjoint Paths on Expander Graphs","display_name":"Existence and Construction of Edge-Disjoint Paths on Expander Graphs","publication_year":1994,"publication_date":"1994-10-01","ids":{"openalex":"https://openalex.org/W2032312374","doi":"https://doi.org/10.1137/s0097539792232021","mag":"2032312374"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539792232021","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792232021","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/A5108541542","display_name":"Andrei Broder","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Andrei Z. Broder","raw_affiliation_strings":["DEC Systems Research Center, 130 Lytton Ave, Palo Alto, CA 94301"],"affiliations":[{"raw_affiliation_string":"DEC Systems Research Center, 130 Lytton Ave, Palo Alto, CA 94301","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056950019","display_name":"Alan Frieze","orcid":"https://orcid.org/0000-0002-8481-5615"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alan M. Frieze","raw_affiliation_strings":["Department of Mathematics, Carnegie-Mellon University"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Carnegie-Mellon University","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028869858","display_name":"Eli Upfal","orcid":"https://orcid.org/0000-0002-9321-9460"},"institutions":[{"id":"https://openalex.org/I4210085935","display_name":"IBM Research - Almaden","ror":"https://ror.org/005w8dd04","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210085935","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eli Upfal","raw_affiliation_strings":["IBM Almaden Research Center, San Jose, CA 95120,"],"affiliations":[{"raw_affiliation_string":"IBM Almaden Research Center, San Jose, CA 95120,","institution_ids":["https://openalex.org/I4210085935"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5108541542"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.2451,"has_fulltext":false,"cited_by_count":72,"citation_normalized_percentile":{"value":0.9269199,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"23","issue":"5","first_page":"976","last_page":"989"},"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9987999796867371,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983000159263611,"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/disjoint-sets","display_name":"Disjoint sets","score":0.8308600187301636},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8113342523574829},{"id":"https://openalex.org/keywords/expander-graph","display_name":"Expander graph","score":0.6736425757408142},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6708008050918579},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5492704510688782},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5283618569374084},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5100494027137756},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.49624019861221313},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.46573251485824585},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3935106694698334},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1483808159828186}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.8308600187301636},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8113342523574829},{"id":"https://openalex.org/C154547637","wikidata":"https://www.wikidata.org/wiki/Q776602","display_name":"Expander graph","level":3,"score":0.6736425757408142},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6708008050918579},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5492704510688782},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5283618569374084},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5100494027137756},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.49624019861221313},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46573251485824585},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3935106694698334},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1483808159828186},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/s0097539792232021","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792232021","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"},{"id":"pmh:oai:repository.cmu.edu:math-1475","is_oa":false,"landing_page_url":"http://repository.cmu.edu/math/476","pdf_url":null,"source":{"id":"https://openalex.org/S4306400668","display_name":"Research Showcase @ Carnegie Mellon University (Carnegie Mellon University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I74973139","host_organization_name":"Carnegie Mellon University","host_organization_lineage":["https://openalex.org/I74973139"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Department of Mathematical Sciences","raw_type":"text"},{"id":"pmh:doi:10.1184/r1/6477353","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Journal contribution"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.6399999856948853,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1519375772","https://openalex.org/W1577466578","https://openalex.org/W1631603072","https://openalex.org/W1998400388","https://openalex.org/W2005079828","https://openalex.org/W2022392080","https://openalex.org/W2047680997","https://openalex.org/W2072211488","https://openalex.org/W2087518343","https://openalex.org/W2093205069","https://openalex.org/W2146017177","https://openalex.org/W2610202827","https://openalex.org/W2610479830","https://openalex.org/W2610729871","https://openalex.org/W4235946010","https://openalex.org/W4238472918"],"related_works":["https://openalex.org/W2940821404","https://openalex.org/W3185918591","https://openalex.org/W4206244388","https://openalex.org/W3109685666","https://openalex.org/W2998932593","https://openalex.org/W3033876040","https://openalex.org/W2754156570","https://openalex.org/W2770134917","https://openalex.org/W4296581269","https://openalex.org/W2008242913"],"abstract_inverted_index":{"Abstract:":[0],"\"Given":[1],"an":[2,153],"expander":[3,160],"graph":[4],"G":[5],"=":[6],"(V,E)":[7],"and":[8,106,118,130,145],"a":[9,31,113,119,157],"set":[10,42,80],"of":[11,15,43,67,81,85,102],"K":[12,44,68,82,95],"disjoint":[13,76,83,164],"pairs":[14,84],"vertices":[16,86],"in":[17,22],"V,":[18],"we":[19,111,151],"are":[20],"interested":[21],"finding":[23],"for":[24,64,140,155],"each":[25],"pair":[26],"(a[subscript":[27],"i],":[28,38],"b[subscript":[29,37],"i]),":[30],"path":[32],"connecting":[33,78],"a[subscript":[34],"i]":[35],"to":[36,136],"such":[39],"that":[40],"the":[41,54,65,99,103],"paths":[45,77],"so":[46],"found":[47],"is":[48,58],"edge":[49,75,163],"disjoint.":[50],"(For":[51],"general":[52],"graphs":[53],"related":[55],"decision":[56],"problem":[57],"NP-complete.)":[59],"We":[60],"prove":[61],"sufficient":[62],"conditions":[63],"existence":[66,128],"[<":[69],"or":[70],"=]":[71],"n/(log":[72],"n)[superscript":[73],"K]":[74],"any":[79,88],"on":[87,98,108],"n":[89],"vertex":[90],"bounded":[91],"degree":[92],"expander,":[93],"where":[94],"depends":[96],"only":[97,134],"expansion":[100],"properties":[101],"input":[104],"graph,":[105],"not":[107],"n.":[109],"Furthermore,":[110],"present":[112],"randomizedo(n\u00e2\u0094\u00ac\u00e2\u0094\u0082)":[114],"[sic]":[115,124],"time":[116],"algorithm,":[117],"random":[120],"NC":[121],"algorithm":[122,154],"forconstructing":[123],"these":[125],"paths.":[126],"(Previous":[127],"proofs":[129],"construction":[131],"algorithms":[132],"allowed":[133],"up":[135],"n[superscript":[137],"epsilon]":[138],"pairs,":[139],"some":[141],"[epsilon]":[142],"<<":[143],"1/3,":[144],"strong":[146,159],"expanders":[147],"[17].)":[148],"In":[149],"passing,":[150],"develop":[152],"splitting":[156],"sufficiently":[158],"into":[161],"two":[162],"spanning":[165],"expanders.\"":[166]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}