{"id":"https://openalex.org/W2566432892","doi":"https://doi.org/10.1109/uemcon.2016.7777894","title":"Fast point-to-point Dyck constrained shortest paths on a DAG (Extended abstract)","display_name":"Fast point-to-point Dyck constrained shortest paths on a DAG (Extended abstract)","publication_year":2016,"publication_date":"2016-10-01","ids":{"openalex":"https://openalex.org/W2566432892","doi":"https://doi.org/10.1109/uemcon.2016.7777894","mag":"2566432892"},"language":"en","primary_location":{"id":"doi:10.1109/uemcon.2016.7777894","is_oa":false,"landing_page_url":"https://doi.org/10.1109/uemcon.2016.7777894","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE 7th Annual Ubiquitous Computing, Electronics & Mobile Communication Conference (UEMCON)","raw_type":"proceedings-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/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"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, The University of Connecticut, Stamford, CT, USA","institution_ids":["https://openalex.org/I140172145"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072565144","display_name":"Venkatesh Choppella","orcid":"https://orcid.org/0000-0003-1085-3464"},"institutions":[{"id":"https://openalex.org/I188963388","display_name":"International Institute of Information Technology","ror":"https://ror.org/02dernx73","country_code":"IN","type":"education","lineage":["https://openalex.org/I188963388"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Venkatesh Choppella","raw_affiliation_strings":["International Institute of Information Technology Gachibowli, Hyderbad, India"],"affiliations":[{"raw_affiliation_string":"International Institute of Information Technology Gachibowli, Hyderbad, India","institution_ids":["https://openalex.org/I188963388"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5108386669"],"corresponding_institution_ids":["https://openalex.org/I140172145"],"apc_list":null,"apc_paid":null,"fwci":0.6969,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.76555378,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9983000159263611,"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/T11567","display_name":"semigroups and automata theory","score":0.9983000159263611,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9980000257492065,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9975000023841858,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.6929606199264526},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6343117356300354},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5936251282691956},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5549086332321167},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.5349005460739136},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5336514115333557},{"id":"https://openalex.org/keywords/joins","display_name":"Joins","score":0.48747968673706055},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.464999794960022},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4625489115715027},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.4408477246761322},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4322482943534851},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4289277493953705},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.4181552529335022},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40138208866119385},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37357473373413086},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33893388509750366},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.31870174407958984}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6929606199264526},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6343117356300354},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5936251282691956},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5549086332321167},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.5349005460739136},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5336514115333557},{"id":"https://openalex.org/C2778692605","wikidata":"https://www.wikidata.org/wiki/Q4041866","display_name":"Joins","level":2,"score":0.48747968673706055},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.464999794960022},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4625489115715027},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.4408477246761322},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4322482943534851},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4289277493953705},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.4181552529335022},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40138208866119385},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37357473373413086},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33893388509750366},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.31870174407958984},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/uemcon.2016.7777894","is_oa":false,"landing_page_url":"https://doi.org/10.1109/uemcon.2016.7777894","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE 7th Annual Ubiquitous Computing, Electronics & 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":19,"referenced_works":["https://openalex.org/W1497287285","https://openalex.org/W1812036194","https://openalex.org/W1982667848","https://openalex.org/W1990051509","https://openalex.org/W2011824721","https://openalex.org/W2024779397","https://openalex.org/W2025063099","https://openalex.org/W2030166143","https://openalex.org/W2033356880","https://openalex.org/W2070992781","https://openalex.org/W2077110643","https://openalex.org/W2080540417","https://openalex.org/W2098278777","https://openalex.org/W2145607287","https://openalex.org/W2569895586","https://openalex.org/W3145128584","https://openalex.org/W3157585079","https://openalex.org/W4246219036","https://openalex.org/W6681467129"],"related_works":["https://openalex.org/W2237480599","https://openalex.org/W2133099431","https://openalex.org/W2018146256","https://openalex.org/W2002764510","https://openalex.org/W4399888599","https://openalex.org/W3032870653","https://openalex.org/W1817899449","https://openalex.org/W2006429817","https://openalex.org/W101813742","https://openalex.org/W1980620373"],"abstract_inverted_index":{"Many":[0],"aspects":[1],"of":[2,24,35,55,83,129,136],"program":[3,48],"analysis":[4],"are":[5],"related":[6],"to":[7,27],"CFL":[8],"(context-free":[9],"language)":[10],"constrained":[11,19],"path":[12,17,41,58,89,100,133,173],"problems":[13,42,59],"on":[14,115,125],"graphs.":[15],"A":[16,143],"is":[18,32,52,114,146],"by":[20,153],"requiring":[21],"its":[22],"list":[23],"edge":[25],"labels":[26],"form":[28],"a":[29,33,70,96,126,168],"string":[30],"that":[31,140,148],"member":[34],"the":[36,53,81,116,130],"associated":[37],"CFL.":[38,72],"Constrained":[39],"shortest":[40,172],"give":[43],"O(n3/":[44],"log":[45,108],"n)-bottlenecks":[46],"for":[47],"analysis,":[49],"where":[50],"n":[51],"number":[54],"nodes.":[56,177],"Labeled":[57],"also":[60],"have":[61],"many":[62],"other":[63],"applications.":[64],"Assume":[65],"two":[66,75,176],"terminals":[67],"(parenthesis)":[68],"in":[69,102,106],"Dyck":[71,99,171],"Given":[73],"any":[74],"vertices":[76],"s":[77],"and":[78,80,85,138,155,159],"t":[79],"output":[82,152],"Nykanen":[84,137,154,158],"Ukkonen's":[86,156,160],"exact":[87,131],"integer":[88,132],"length":[90,134],"algorithm.":[91,157],"then":[92],"this":[93],"paper":[94,113],"finds":[95],"minimal-cost":[97,169],"point-to-point":[98,170],"cost":[101,174],"such":[103],"edge-labeled":[104],"digraphs":[105],"O(n2":[107],"n)":[109],"additional":[110],"operations.":[111],"This":[112],"DAG":[117],"(directed":[118],"acyclic":[119],"graph)":[120],"case.":[121],"Our":[122],"result":[123],"depends":[124],"special":[127,150],"case":[128],"problem":[135],"Ukkonen":[139],"costs":[141],"O(n3).":[142],"new":[144],"algorithm":[145,161,166],"introduced":[147],"joins":[149],"edges":[151],"along":[162],"with":[163],"our":[164],"basic":[165],"gives":[167],"between":[175]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}