{"id":"https://openalex.org/W2156068267","doi":"https://doi.org/10.1137/s0097539701398582","title":"Arc-Disjoint Paths in Expander Digraphs","display_name":"Arc-Disjoint Paths in Expander Digraphs","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2156068267","doi":"https://doi.org/10.1137/s0097539701398582","mag":"2156068267"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539701398582","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539701398582","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/A5079523589","display_name":"Tom Bohman","orcid":"https://orcid.org/0000-0002-4051-2401"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Tom Bohman","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","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 Frieze","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5079523589"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0903,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.79203115,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"32","issue":"2","first_page":"326","last_page":"344"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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":1.0,"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.9991999864578247,"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.9988999962806702,"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/digraph","display_name":"Digraph","score":0.9245263338088989},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8746880292892456},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.8386029601097107},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7002444267272949},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.5947123765945435},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5849738121032715},{"id":"https://openalex.org/keywords/expander-graph","display_name":"Expander graph","score":0.5230035185813904},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4958396852016449},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47946035861968994},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.4649777412414551},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4221723973751068},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.420221745967865},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4200098514556885},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11667531728744507},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.107826828956604},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10304400324821472}],"concepts":[{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.9245263338088989},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8746880292892456},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.8386029601097107},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7002444267272949},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.5947123765945435},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5849738121032715},{"id":"https://openalex.org/C154547637","wikidata":"https://www.wikidata.org/wiki/Q776602","display_name":"Expander graph","level":3,"score":0.5230035185813904},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4958396852016449},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47946035861968994},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.4649777412414551},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4221723973751068},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.420221745967865},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4200098514556885},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11667531728744507},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.107826828956604},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10304400324821472},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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/s0097539701398582","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539701398582","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.19.4884","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.4884","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.aladdin.cs.cmu.edu/papers/pdfs/y2001/dirpath.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.28.4955","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.4955","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/dirpaths.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.9.2144","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.2144","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/~tbohman/papers/focs01.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1484040084","https://openalex.org/W1969534344","https://openalex.org/W1971656597","https://openalex.org/W2005079828","https://openalex.org/W2032312374","https://openalex.org/W2046202598","https://openalex.org/W2058778915","https://openalex.org/W2059570262","https://openalex.org/W2072211488","https://openalex.org/W2150148016","https://openalex.org/W2569646339","https://openalex.org/W2610202827","https://openalex.org/W2989713547","https://openalex.org/W4235946010","https://openalex.org/W4255280903"],"related_works":["https://openalex.org/W2038088825","https://openalex.org/W1975203667","https://openalex.org/W2370328482","https://openalex.org/W4287882779","https://openalex.org/W2046896701","https://openalex.org/W2265849288","https://openalex.org/W2140169421","https://openalex.org/W143702185","https://openalex.org/W1988947197","https://openalex.org/W2780684839"],"abstract_inverted_index":{"Given":[0],"a":[1,5,24,55,102],"digraph":[2,68],"D=(V,A)":[3],"and":[4,80],"set":[6,34],"of":[7,10,35,90,94,105],"$\\kappa$":[8,36],"pairs":[9,93],"vertices":[11,95],"in":[12,17,64],"V,":[13],"we":[14],"are":[15],"interested":[16],"finding,":[18],"for":[19,51,60],"each":[20],"pair":[21],"(xi,":[22],"yi),":[23],"directed":[25],"path":[26],"connecting":[27],"xi":[28],"to":[29],"yi":[30],"such":[31],"that":[32,72],"the":[33,45,81],"paths":[37,63],"so":[38],"found":[39],"is":[40,47,84,100],"arc-disjoint.":[41],"For":[42],"arbitrary":[43],"graphs":[44],"problem":[46],"${\\cal":[48],"NP}$-complete,":[49],"even":[50],"$\\kappa=2$.":[52],"We":[53,70],"present":[54],"polynomial":[56],"time":[57],"randomized":[58],"algorithm":[59],"finding":[61],"arc-disjoint":[62],"an":[65],"r-regular":[66],"expander":[67],"D.":[69],"show":[71],"if":[73],"D":[74],"has":[75],"sufficiently":[76,85],"strong":[77],"expansion":[78],"properties":[79],"degree":[82],"r":[83],"large,":[86],"then":[87],"all":[88],"sets":[89],"$\\kappa=\\Omega(n/\\log":[91],"n)$":[92],"can":[96],"be":[97],"joined.":[98],"This":[99],"within":[101],"constant":[103],"factor":[104],"best":[106],"possible.":[107]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}