{"id":"https://openalex.org/W2783940942","doi":"https://doi.org/10.1109/uemcon.2017.8249039","title":"Efficient exact paths for dyck and semi-dyck labeled path reachability (extended abstract)","display_name":"Efficient exact paths for dyck and semi-dyck labeled path reachability (extended abstract)","publication_year":2017,"publication_date":"2017-10-01","ids":{"openalex":"https://openalex.org/W2783940942","doi":"https://doi.org/10.1109/uemcon.2017.8249039","mag":"2783940942"},"language":"en","primary_location":{"id":"doi:10.1109/uemcon.2017.8249039","is_oa":false,"landing_page_url":"https://doi.org/10.1109/uemcon.2017.8249039","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE 8th Annual Ubiquitous Computing, Electronics and Mobile Communication Conference (UEMCON)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5108386669","display_name":"Phillip G. Bradford","orcid":null},"institutions":[{"id":"https://openalex.org/I140172145","display_name":"University of Connecticut","ror":"https://ror.org/02der9h97","country_code":"US","type":"education","lineage":["https://openalex.org/I140172145"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Phillip G. Bradford","raw_affiliation_strings":["Department of Computer Science and Engineering, The University of Connecticut, Stamford, CT, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, The University of Connecticut, Stamford, CT, USA","institution_ids":["https://openalex.org/I140172145"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5108386669"],"corresponding_institution_ids":["https://openalex.org/I140172145"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.22565969,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"247","last_page":"253"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9988999962806702,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.8606639504432678},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6945760250091553},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.6733018159866333},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6425917148590088},{"id":"https://openalex.org/keywords/edit-distance","display_name":"Edit distance","score":0.450493723154068},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4479163587093353},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4338720738887787},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36555200815200806},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31306833028793335}],"concepts":[{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.8606639504432678},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6945760250091553},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.6733018159866333},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6425917148590088},{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.450493723154068},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4479163587093353},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4338720738887787},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36555200815200806},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31306833028793335},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/uemcon.2017.8249039","is_oa":false,"landing_page_url":"https://doi.org/10.1109/uemcon.2017.8249039","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE 8th Annual Ubiquitous Computing, Electronics and Mobile Communication Conference (UEMCON)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W1497287285","https://openalex.org/W1540625694","https://openalex.org/W1812036194","https://openalex.org/W1823654214","https://openalex.org/W1970052762","https://openalex.org/W1979740015","https://openalex.org/W1979867994","https://openalex.org/W1982667848","https://openalex.org/W1990051509","https://openalex.org/W1996513497","https://openalex.org/W2011824721","https://openalex.org/W2024779397","https://openalex.org/W2025063099","https://openalex.org/W2030166143","https://openalex.org/W2033356880","https://openalex.org/W2038073775","https://openalex.org/W2044922487","https://openalex.org/W2048541310","https://openalex.org/W2049500052","https://openalex.org/W2064982280","https://openalex.org/W2070992781","https://openalex.org/W2072985157","https://openalex.org/W2077110643","https://openalex.org/W2080540417","https://openalex.org/W2089633648","https://openalex.org/W2098278777","https://openalex.org/W2120248756","https://openalex.org/W2145607287","https://openalex.org/W2478352205","https://openalex.org/W2566432892","https://openalex.org/W2569895586","https://openalex.org/W2618199688","https://openalex.org/W2752573522","https://openalex.org/W3145128584","https://openalex.org/W3157585079","https://openalex.org/W6681467129"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2127267268","https://openalex.org/W2136512912","https://openalex.org/W2130254085","https://openalex.org/W4300501056","https://openalex.org/W2765600275","https://openalex.org/W3037911602","https://openalex.org/W3082487952","https://openalex.org/W3040348990","https://openalex.org/W4288357225"],"abstract_inverted_index":{"Consider":[0],"any":[1,171],"two":[2,101],"vertices":[3],"in":[4,143,213],"a":[5,19,22,144,150],"weighted":[6],"digraph.":[7],"The":[8,195],"exact":[9,34,69,118,196],"path":[10,20,35,70,119,122,156,197,208],"length":[11,198],"problem":[12,36,199],"is":[13,18,50,74,158],"to":[14,53],"determine":[15,86],"if":[16],"there":[17],"of":[21,45,83,89,180,190],"given":[23,135,210],"fixed":[24],"cost":[25],"between":[26,42,98],"these":[27,131],"vertices.":[28,46],"This":[29,47],"paper":[30,65],"focuses":[31],"on":[32,153],"the":[33,75,117,165,177,206],"for":[37,78,108],"costs":[38,114],"-1,0":[39],"or":[40,94,103,110,140,185],"+1":[41],"all":[43,162],"pairs":[44,88],"special":[48,62],"case":[49],"also":[51],"restricted":[52],"original":[54],"edge":[55,148],"weights":[56],"from":[57],"{-1,":[58],"+1}.":[59],"In":[60],"this":[61,64,84],"case,":[63],"gives":[66],"an":[67,187],"O(n\u03c9log2n)":[68],"solution,":[71],"where":[72],"\u03c9":[73],"best":[76],"exponent":[77],"matrix":[79],"multiplication.":[80],"Basic":[81],"variations":[82],"algorithm":[85],"which":[87,212],"digraph":[90],"nodes":[91],"have":[92,176,186,215],"Dyck":[93,109,139],"semi-Dyck":[95,111,141],"labeled":[96,112,121,145,207],"paths":[97,113,175],"them,":[99],"assuming":[100],"terminals":[102],"parenthesis.":[104],"Therefore,":[105],"determining":[106],"reachability":[107,142],"O(n\u03c9log2n).":[115],"Both":[116],"and":[120],"solutions":[123],"can":[124],"be":[125],"improved":[126],"by":[127,160],"poly-log":[128],"factors,":[129],"but":[130],"improvements":[132],"are":[133,168],"not":[134],"here.":[136],"To":[137],"find":[138],"digraph,":[146],"each":[147],"has":[149,200],"single":[151],"symbol":[152],"it.":[154],"A":[155],"label":[157],"made":[159],"concatenating":[161],"symbols":[163,192],"along":[164],"path.":[166],"Cycles":[167],"allowed":[169],"without":[170],"repeated":[172],"edges.":[173],"These":[174,203],"same":[178],"number":[179],"balanced":[181],"parenthesizations":[182],"(semi-Dyck":[183],"languages)":[184],"equal":[188],"numbers":[189],"matching":[191],"(Dyck":[193],"languages).":[194],"many":[201,216],"applications.":[202,217],"applications":[204],"include":[205],"problems":[209],"here,":[211],"turn,":[214]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}