{"id":"https://openalex.org/W2767323816","doi":"https://doi.org/10.1137/18m1197850","title":"Nearly Work-Efficient Parallel Algorithm for Digraph Reachability","display_name":"Nearly Work-Efficient Parallel Algorithm for Digraph Reachability","publication_year":2018,"publication_date":"2018-06-20","ids":{"openalex":"https://openalex.org/W2767323816","doi":"https://doi.org/10.1137/18m1197850","mag":"2767323816"},"language":"en","primary_location":{"id":"doi:10.1137/18m1197850","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1197850","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":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3188745.3188926","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011772692","display_name":"Jeremy T. Fineman","orcid":"https://orcid.org/0009-0000-7483-4532"},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jeremy T. Fineman","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5011772692"],"corresponding_institution_ids":["https://openalex.org/I184565670"],"apc_list":null,"apc_paid":null,"fwci":0.169,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.57155001,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"49","issue":"5","first_page":"457","last_page":"470"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9987000226974487,"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/digraph","display_name":"Digraph","score":0.7452946901321411},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.7249387502670288},{"id":"https://openalex.org/keywords/topological-sorting","display_name":"Topological sorting","score":0.6551073789596558},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6068395376205444},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5725274085998535},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48343953490257263},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.45828762650489807},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.44635188579559326},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42366665601730347},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4234636127948761},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39060884714126587},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37988758087158203}],"concepts":[{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.7452946901321411},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7249387502670288},{"id":"https://openalex.org/C176032523","wikidata":"https://www.wikidata.org/wiki/Q753127","display_name":"Topological sorting","level":3,"score":0.6551073789596558},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6068395376205444},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5725274085998535},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48343953490257263},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.45828762650489807},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.44635188579559326},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42366665601730347},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4234636127948761},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39060884714126587},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37988758087158203}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/18m1197850","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1197850","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":"doi:10.1145/3188745.3188926","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3188745.3188926","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3188745.3188926","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1711.01700","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1711.01700","pdf_url":"https://arxiv.org/pdf/1711.01700","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},{"id":"mag:2767323816","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1711.01700.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1711.01700","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1711.01700","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1145/3188745.3188926","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3188745.3188926","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3188745.3188926","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4863540084","display_name":null,"funder_award_id":"CCF-1617727","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5601193151","display_name":null,"funder_award_id":"CCF-1718700","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7255749973","display_name":null,"funder_award_id":"CCF-1617727, CCF-1314633","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7481140203","display_name":"SHF: AF: Large: Collaborative Research: Parallelism without Concurrency","funder_award_id":"1314633","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7539650863","display_name":null,"funder_award_id":"CCF-1314633","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G800951108","display_name":"AF: Small: Collaborative Research: Maintaining order","funder_award_id":"1617727","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8543173072","display_name":"AF: Small: Algorithms for New Memory Models","funder_award_id":"1718700","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2767323816.pdf","grobid_xml":"https://content.openalex.org/works/W2767323816.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W1973393028","https://openalex.org/W1978583881","https://openalex.org/W1986816824","https://openalex.org/W2004618348","https://openalex.org/W2008840956","https://openalex.org/W2032825346","https://openalex.org/W2039972044","https://openalex.org/W2041645051","https://openalex.org/W2042010354","https://openalex.org/W2056496054","https://openalex.org/W2074456731","https://openalex.org/W2075862701","https://openalex.org/W2081608347","https://openalex.org/W2081804932","https://openalex.org/W2094090625","https://openalex.org/W2097884397","https://openalex.org/W2120248756","https://openalex.org/W2120490947","https://openalex.org/W2130566259","https://openalex.org/W2469481711","https://openalex.org/W2752885492","https://openalex.org/W4235193372"],"related_works":["https://openalex.org/W2950274216","https://openalex.org/W1811822729","https://openalex.org/W1513315626","https://openalex.org/W2536112642","https://openalex.org/W1590822864","https://openalex.org/W2952395520","https://openalex.org/W2903327508","https://openalex.org/W2140011380","https://openalex.org/W2528290647","https://openalex.org/W2887341375","https://openalex.org/W3004078918","https://openalex.org/W1591101196","https://openalex.org/W3182218004","https://openalex.org/W2950562895","https://openalex.org/W2513426592","https://openalex.org/W1966224002","https://openalex.org/W1994558960","https://openalex.org/W3130029923","https://openalex.org/W2374300355","https://openalex.org/W3041779128"],"abstract_inverted_index":{"One":[0],"of":[1,10,14,63,171,201,207],"the":[2,12,64,89,128,161,167,172,199,205,208,228,248,261],"simplest":[3],"problems":[4,103],"on":[5,117],"directed":[6,156,177],"graphs":[7,46],"is":[8,50,91,127,163,191],"that":[9,88,246,258],"identifying":[11],"set":[13],"vertices":[15,122],"reachable":[16],"from":[17],"a":[18,31,75,94,155,176,241],"designated":[19],"source":[20],"vertex.":[21],"This":[22,59,85,126,238],"problem":[23],"can":[24,150],"be":[25,151],"solved":[26],"easily":[27],"sequentially":[28],"by":[29],"performing":[30],"graph":[32,71,119,162,209],"search,":[33],"but":[34,264],"efficient":[35,193],"parallel":[36,54,70,76,96,130,219],"algorithms":[37,220,230],"have":[38],"eluded":[39],"researchers":[40],"for":[41,78,98,144],"decades.":[42],"For":[43],"sparse":[44],"high-diameter":[45],"in":[47,69,254],"particular,":[48],"there":[49,74],"no":[51],"known":[52,222],"work-efficient":[53],"algorithm":[55,77,97,131,149,196,245,259],"with":[56,81,104,120,181,212,223],"nontrivial":[57],"parallelism.":[58],"amounts":[60],"to":[61,153,210],"one":[62],"most":[65],"fundamental":[66],"open":[67],"questions":[68],"algorithms:":[72],"Is":[73],"digraph":[79,99],"reachability":[80,100],"nearly":[82,134],"linear":[83,135],"work?":[84],"article":[86,239],"shows":[87],"answer":[90],"yes,":[92],"presenting":[93],"randomized":[95],"and":[101,108,111,123,137,184,218,252],"related":[102],"expected":[105],"work":[106,136,182],"$\\tilde{O}(m)$":[107,183,255],"span":[109,142,185],"$\\tilde{O}(n^{2/3})$,":[110],"hence":[112],"parallelism":[113],"$\\tilde{\\Omega}(m/n^{2/3})":[114],"=":[115],"\\tilde{\\Omega}(n^{1/3})$,":[116],"any":[118,145],"$n$":[121],"$m$":[124],"arcs.":[125],"first":[129],"having":[132,234],"both":[133,216],"strongly":[138,168],"sublinear":[139],"span,":[140],"i.e.,":[141],"$\\tilde{O}(n^{1-\\epsilon})$":[143],"constant":[146],"$\\epsilon>0$.":[147],"The":[148,187],"extended":[152],"produce":[154,175],"spanning":[157],"tree,":[158],"determine":[159],"whether":[160],"acyclic,":[164],"topologically":[165],"sort":[166],"connected":[169],"components":[170],"graph,":[173],"or":[174],"ear":[178],"decomposition,":[179],"all":[180],"$\\tilde{O}(n^{2/3})$.":[186],"main":[188,262],"technical":[189],"contribution":[190],"an":[192],"Monte":[194],"Carlo":[195],"that,":[197],"through":[198],"addition":[200],"$\\tilde{O}(n)$":[202],"shortcuts,":[203],"reduces":[204],"diameter":[206,250],"$\\tilde{O}(n^{2/3})$":[211],"high":[213],"probability.":[214],"While":[215],"sequential":[217,229,235,244],"are":[221,231],"those":[224],"combinatorial":[225],"properties,":[226],"even":[227],"not":[232],"efficient,":[233],"runtime":[236],"$\\Omega(mn^{\\Omega(1)})$.":[237],"presents":[240],"surprisingly":[242],"simple":[243],"achieves":[247],"stated":[249],"reduction":[251],"runs":[253],"time.":[256],"Parallelizing":[257],"yields":[260],"result,":[263],"doing":[265],"so":[266],"involves":[267],"overcoming":[268],"several":[269],"other":[270],"challenges.":[271]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-13T07:54:00.901334","created_date":"2025-10-10T00:00:00"}