{"id":"https://openalex.org/W4386198393","doi":"https://doi.org/10.4086/toc.2023.v019a002","title":"","display_name":"","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W4386198393","doi":"https://doi.org/10.4086/toc.2023.v019a002"},"language":"en","primary_location":{"id":"doi:10.4086/toc.2023.v019a002","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2023.v019a002","pdf_url":"https://theoryofcomputing.org/articles/v019a002/v019a002.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://theoryofcomputing.org/articles/v019a002/v019a002.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102874179","display_name":"Rahul Jain","orcid":"https://orcid.org/0000-0002-8567-9475"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rahul Jain","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5102431831","display_name":"Raghunath Tewari","orcid":"https://orcid.org/0000-0003-1522-8561"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Raghunath Tewari","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09292629,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"19","issue":"1","first_page":"1","last_page":"23"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9941999912261963,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9941999912261963,"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"}},{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9912999868392944,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.974399983882904,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.9348137378692627},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.6343398094177246},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5919766426086426},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5191215872764587},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.404376745223999},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3993062376976013},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37529367208480835}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9348137378692627},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.6343398094177246},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5919766426086426},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5191215872764587},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.404376745223999},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3993062376976013},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37529367208480835},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4086/toc.2023.v019a002","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2023.v019a002","pdf_url":"https://theoryofcomputing.org/articles/v019a002/v019a002.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.4086/toc.2023.v019a002","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2023.v019a002","pdf_url":"https://theoryofcomputing.org/articles/v019a002/v019a002.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.41999998688697815}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4386198393.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2127267268","https://openalex.org/W2136512912","https://openalex.org/W2067910792","https://openalex.org/W2772294324","https://openalex.org/W4253760428","https://openalex.org/W2047831585","https://openalex.org/W3082487952","https://openalex.org/W3040348990","https://openalex.org/W4288357225"],"abstract_inverted_index":{"The":[0],"reachability":[1,60,110],"problem":[2,67,111],"asks":[3],"to":[4,14,83,107,129,141],"decide":[5],"if":[6],"there":[7,96],"exists":[8,97],"a":[9,17,20,29,39,98,113,123,131,138],"path":[10],"from":[11],"one":[12],"vertex":[13,40],"another":[15],"in":[16,61,68,112,137],"digraph.":[18],"In":[19,76,90],"grid":[21,62,114],"digraph,":[22],"the":[23,26,54,66,78,109],"vertices":[24],"are":[25],"points":[27],"of":[28],"two-dimensional":[30],"square":[31],"grid,":[32],"and":[33,41,45,50,71,87,121],"an":[34],"edge":[35],"can":[36],"occur":[37],"between":[38],"its":[42],"immediate":[43],"horizontal":[44],"vertical":[46],"neighbors":[47],"only.":[48],"Asano":[49],"Doerr":[51],"(CCCG'11)":[52],"presented":[53],"first":[55],"simultaneous":[56],"time-space":[57],"bound":[58],"for":[59],"digraphs":[63],"by":[64,85],"solving":[65],"polynomial":[69],"time":[70],"$O(n^{1/2":[72],"+":[73,104],"\\epsilon})$":[74,105],"space.":[75],"2018,":[77],"space":[79,106],"complexity":[80],"was":[81],"improved":[82],"$\\tilde{O}(n^{1/3})$":[84],"Ashida":[86],"Nakagawa":[88],"(SoCG'18).":[89],"this":[91],"paper,":[92],"we":[93],"show":[94],"that":[95,101],"polynomial-time":[99],"algorithm":[100,135],"uses":[102],"$O(n^{1/4":[103],"solve":[108,142],"digraph":[115],"containing":[116],"$n$":[117],"vertices.":[118],"We":[119],"define":[120],"construct":[122],"new":[124],"separator-like":[125],"device":[126],"called":[127],"pseudoseparator":[128],"develop":[130],"divide-and-conquer":[132],"algorithm.":[133],"This":[134],"works":[136],"space-efficient":[139],"manner":[140],"reachability.":[143]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2023-08-27T00:00:00"}