{"id":"https://openalex.org/W2284807260","doi":"https://doi.org/10.1142/s1793830915500597","title":"On reachability in graphs with obstacles","display_name":"On reachability in graphs with obstacles","publication_year":2015,"publication_date":"2015-10-13","ids":{"openalex":"https://openalex.org/W2284807260","doi":"https://doi.org/10.1142/s1793830915500597","mag":"2284807260"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830915500597","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830915500597","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","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/A5067669150","display_name":"Udit Agarwal","orcid":"https://orcid.org/0009-0007-2446-1310"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Udit Agarwal","raw_affiliation_strings":["Department of Computer Science, University of Texas at Austin, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas at Austin, USA","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065965147","display_name":"Kalpesh Kapoor","orcid":"https://orcid.org/0000-0002-0242-3563"},"institutions":[{"id":"https://openalex.org/I1317621060","display_name":"Indian Institute of Technology Guwahati","ror":"https://ror.org/0022nd079","country_code":"IN","type":"education","lineage":["https://openalex.org/I1317621060"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Kalpesh Kapoor","raw_affiliation_strings":["Department of Mathematics, Indian Institute of Technology Guwahati, India"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Indian Institute of Technology Guwahati, India","institution_ids":["https://openalex.org/I1317621060"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5067669150"],"corresponding_institution_ids":["https://openalex.org/I86519309"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16343573,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"07","issue":"04","first_page":"1550059","last_page":"1550059"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9969000220298767,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9300218820571899},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6652635931968689},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6477768421173096},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.5561719536781311},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5041927099227905},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48470568656921387},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.48107433319091797},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4570598006248474},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44636887311935425},{"id":"https://openalex.org/keywords/strongly-connected-component","display_name":"Strongly connected component","score":0.43753504753112793},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.42868390679359436},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41062816977500916}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9300218820571899},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6652635931968689},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6477768421173096},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.5561719536781311},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5041927099227905},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48470568656921387},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.48107433319091797},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4570598006248474},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44636887311935425},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.43753504753112793},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.42868390679359436},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41062816977500916},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830915500597","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830915500597","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W196900508","https://openalex.org/W1484040084","https://openalex.org/W1930659875","https://openalex.org/W1965454152","https://openalex.org/W1986164452","https://openalex.org/W1991572458","https://openalex.org/W2006121663","https://openalex.org/W2015469394","https://openalex.org/W2034604437","https://openalex.org/W2043528001","https://openalex.org/W2048036606","https://openalex.org/W2083721544","https://openalex.org/W2100548703","https://openalex.org/W2122726981","https://openalex.org/W3141776272","https://openalex.org/W4246219036"],"related_works":["https://openalex.org/W2047831585","https://openalex.org/W4253760428","https://openalex.org/W2099490078","https://openalex.org/W3208672221","https://openalex.org/W2241132100","https://openalex.org/W3124866060","https://openalex.org/W3160940394","https://openalex.org/W3020958106","https://openalex.org/W570174078","https://openalex.org/W2953576521"],"abstract_inverted_index":{"Given":[0],"a":[1,6,16,19,124],"graph,":[2],"[Formula:":[3,9,31,85,96,100,134,138],"see":[4,10,32,86,97,101,135,139],"text],":[5],"configuration":[7],"of":[8,30,69,79,95,113,119,133],"text]":[11,33,87,98,136],"represents":[12],"that":[13,73,109],"there":[14],"is":[15,63],"robot":[17,37,47],"at":[18,23],"vertex":[20,60],"and":[21,71],"obstacles":[22],"some":[24],"other":[25],"vertices.":[26],"The":[27,46],"remaining":[28],"vertices":[29],"not":[34],"having":[35],"the":[36,92,110,130],"or":[38,48],"an":[39,49,58,84],"obstacle":[40,50],"are":[41,75,115],"said":[42],"to":[43,57],"be":[44,52],"empty.":[45,64],"can":[51],"moved":[53],"from":[54],"its":[55],"place":[56],"adjacent":[59],"if":[61],"it":[62],"We":[65,82,122],"give":[66,83],"two":[67,111],"definitions":[68],"reachability":[70,114],"show":[72,108],"they":[74],"equivalent":[76],"in":[77,103,117,141],"case":[78,118],"undirected":[80,104],"graphs.":[81,105,121],"time":[88,126],"algorithm":[89,127],"for":[90,99,128,137],"computing":[91,129],"minimum":[93,131],"value":[94,132],"text]-reachability":[102,140],"However,":[106],"we":[107],"notions":[112],"different":[116],"directed":[120,142],"present":[123],"linear":[125],"trees.":[143]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}