{"id":"https://openalex.org/W2015236004","doi":"https://doi.org/10.1137/s0097539795290805","title":"Optimal Construction of Edge-Disjoint Paths in Random Graphs","display_name":"Optimal Construction of Edge-Disjoint Paths in Random Graphs","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W2015236004","doi":"https://doi.org/10.1137/s0097539795290805","mag":"2015236004"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539795290805","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539795290805","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":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056950019","display_name":"Alan Frieze","orcid":"https://orcid.org/0000-0002-8481-5615"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alan M. Frieze","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082619047","display_name":"Stephen Suen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stephen Suen","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5028869858","display_name":"Eli Upfal","orcid":"https://orcid.org/0000-0002-9321-9460"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Eli Upfal","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5108541542"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0169,"has_fulltext":false,"cited_by_count":60,"citation_normalized_percentile":{"value":0.75176133,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"28","issue":"2","first_page":"541","last_page":"573"},"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.9987999796867371,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.5849466919898987},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5488399863243103},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5385734438896179},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.519045889377594},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46893858909606934},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4289565086364746},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4275321066379547},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3535345792770386},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.21367058157920837},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11622941493988037}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5849466919898987},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5488399863243103},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5385734438896179},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.519045889377594},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46893858909606934},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4289565086364746},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4275321066379547},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3535345792770386},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.21367058157920837},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11622941493988037}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/s0097539795290805","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539795290805","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:CiteSeerX.psu:10.1.1.44.7541","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.7541","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.cmu.edu/~af1p/randedge.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.87.9829","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.87.9829","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.brown.edu/~eli/papers/SIAM28.2.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":8,"referenced_works":["https://openalex.org/W1968084791","https://openalex.org/W1997698259","https://openalex.org/W2005079828","https://openalex.org/W2032312374","https://openalex.org/W2047680997","https://openalex.org/W2072211488","https://openalex.org/W2091476183","https://openalex.org/W4255280903"],"related_works":["https://openalex.org/W4256429076","https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W2348092930","https://openalex.org/W2012063272","https://openalex.org/W2138685729","https://openalex.org/W2062850566","https://openalex.org/W4308716484","https://openalex.org/W2098284475","https://openalex.org/W1553466895"],"abstract_inverted_index":{"Given":[0],"a":[1,10,29,67],"graph":[2,88,99],"G=(V,E)":[3],"with":[4],"n":[5],"vertices,":[6],"m":[7],"edges,":[8],"and":[9],"family":[11],"of":[12,15,39,77,109,127],"$\\kappa$":[13,40,62],"pairs":[14,108],"vertices":[16],"in":[17,22,58,85],"V,":[18],"we":[19],"are":[20],"interested":[21],"finding":[23,73],"for":[24,72,90,118,123],"each":[25],"pair":[26],"(ai,":[27],"bi)":[28],"path":[30],"connecting":[31],"ai":[32],"to":[33,82],"bi":[34],"such":[35],"that":[36],"the":[37,50,74,86,95,107,114,119],"set":[38],"paths":[41,80,121],"so":[42],"found":[43],"is":[44,52,57,63,100],"edge":[45,78,92],"disjoint.":[46],"(For":[47],"arbitrary":[48],"graphs":[49],"problem":[51,122],"${\\cal":[53,59],"NP}$-complete,":[54],"although":[55],"it":[56],"P}$":[60],"if":[61],"fixed.)":[64],"We":[65],"present":[66],"polynomial":[68],"time":[69],"randomized":[70],"algorithm":[71],"optimal":[75],"number":[76],"disjoint":[79],"(up":[81],"constant":[83],"factors)":[84],"random":[87],"Gn,m":[89],"all":[91],"densities":[93],"above":[94],"connectivity":[96],"threshold.":[97],"(The":[98],"chosen":[101],"first;":[102],"then":[103],"an":[104],"adversary":[105],"chooses":[106],"endpoints.)":[110],"Our":[111],"results":[112],"give":[113],"first":[115],"tight":[116],"bounds":[117],"edge-disjoint":[120],"any":[124],"nontrivial":[125],"class":[126],"graphs.":[128]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"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"}