{"id":"https://openalex.org/W2011824721","doi":"https://doi.org/10.1137/s0097539798337716","title":"Formal-Language-Constrained Path Problems","display_name":"Formal-Language-Constrained Path Problems","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2011824721","doi":"https://doi.org/10.1137/s0097539798337716","mag":"2011824721"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539798337716","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539798337716","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":"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/A5101791984","display_name":"Chris Barrett","orcid":"https://orcid.org/0000-0003-1708-3554"},"institutions":[{"id":"https://openalex.org/I1343871089","display_name":"Los Alamos National Laboratory","ror":"https://ror.org/01e41cf67","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I1343871089","https://openalex.org/I198811213","https://openalex.org/I4210120050"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Chris Barrett","raw_affiliation_strings":["Los Alamos National Laboratory, Los Alamos;"],"affiliations":[{"raw_affiliation_string":"Los Alamos National Laboratory, Los Alamos;","institution_ids":["https://openalex.org/I1343871089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072095949","display_name":"Riko Jacob","orcid":"https://orcid.org/0000-0001-9470-1809"},"institutions":[{"id":"https://openalex.org/I1343871089","display_name":"Los Alamos National Laboratory","ror":"https://ror.org/01e41cf67","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I1343871089","https://openalex.org/I198811213","https://openalex.org/I4210120050"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Riko Jacob","raw_affiliation_strings":["Los Alamos National Laboratory, Los Alamos;"],"affiliations":[{"raw_affiliation_string":"Los Alamos National Laboratory, Los Alamos;","institution_ids":["https://openalex.org/I1343871089"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020293284","display_name":"Madhav Marathe","orcid":"https://orcid.org/0000-0003-1653-0658"},"institutions":[{"id":"https://openalex.org/I1343871089","display_name":"Los Alamos National Laboratory","ror":"https://ror.org/01e41cf67","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I1343871089","https://openalex.org/I198811213","https://openalex.org/I4210120050"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Madhav Marathe","raw_affiliation_strings":["Los Alamos National Laboratory, Los Alamos;"],"affiliations":[{"raw_affiliation_string":"Los Alamos National Laboratory, Los Alamos;","institution_ids":["https://openalex.org/I1343871089"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101791984"],"corresponding_institution_ids":["https://openalex.org/I1343871089"],"apc_list":null,"apc_paid":null,"fwci":5.1529,"has_fulltext":false,"cited_by_count":174,"citation_normalized_percentile":{"value":0.95620384,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"30","issue":"3","first_page":"809","last_page":"837"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9943000078201294,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9943000078201294,"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/T11106","display_name":"Data Management and Algorithms","score":0.9879000186920166,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9860000014305115,"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/combinatorics","display_name":"Combinatorics","score":0.6031333804130554},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6009384989738464},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5604885220527649},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5566624999046326},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5511415600776672},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.47814950346946716},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4649936258792877},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.4629662036895752},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.4611639380455017},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4589885175228119},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.44594916701316833},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37838664650917053},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3374062776565552},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.20217740535736084},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.18879589438438416},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.13729313015937805}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6031333804130554},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6009384989738464},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5604885220527649},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5566624999046326},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5511415600776672},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47814950346946716},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4649936258792877},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.4629662036895752},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.4611639380455017},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4589885175228119},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.44594916701316833},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37838664650917053},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3374062776565552},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.20217740535736084},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.18879589438438416},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.13729313015937805},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539798337716","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539798337716","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W200063938","https://openalex.org/W618007181","https://openalex.org/W1506691924","https://openalex.org/W1506765525","https://openalex.org/W1591510600","https://openalex.org/W1655990431","https://openalex.org/W1969483458","https://openalex.org/W1975638108","https://openalex.org/W1977545325","https://openalex.org/W1980622548","https://openalex.org/W1982206794","https://openalex.org/W2002089154","https://openalex.org/W2002614628","https://openalex.org/W2010194128","https://openalex.org/W2011039300","https://openalex.org/W2016056456","https://openalex.org/W2018876684","https://openalex.org/W2029706450","https://openalex.org/W2030166143","https://openalex.org/W2034112563","https://openalex.org/W2037998882","https://openalex.org/W2042853248","https://openalex.org/W2059275719","https://openalex.org/W2064796716","https://openalex.org/W2089338760","https://openalex.org/W2130626677","https://openalex.org/W2135282325","https://openalex.org/W2159003936","https://openalex.org/W2168761942","https://openalex.org/W2180471588","https://openalex.org/W2476096155","https://openalex.org/W2752885492","https://openalex.org/W2888871578","https://openalex.org/W2913344232","https://openalex.org/W3166327929"],"related_works":["https://openalex.org/W4382866750","https://openalex.org/W4293167680","https://openalex.org/W2776102956","https://openalex.org/W4387185483","https://openalex.org/W2022506245","https://openalex.org/W2040572217","https://openalex.org/W2388410942","https://openalex.org/W4385965963","https://openalex.org/W2600678155","https://openalex.org/W2018146256"],"abstract_inverted_index":{"Given":[0],"an":[1],"alphabet":[2],"$\\Sigma$,":[3],"a":[4,15,27,90,99,120,124,127,166,249,256],"(directed)":[5],"graph":[6],"G":[7,33],"whose":[8],"edges":[9,56],"are":[10,244],"weighted":[11],"and":[12,14,108,126,142,172,179,216,233,299],"$\\Sigma$-labeled,":[13],"formal":[16],"language":[17,92,101],"$L\\subseteq\\Sigma^*$,":[18],"the":[19,36,46,52,55,58,68,73,116,153,162,181,193,206,211,219,239,260,269,274,289,294,304],"formal-language-constrained":[20,74],"shortest/simple":[21],"path":[22,30,59,76,122,169,263],"problem":[23,77,117,163,264],"consists":[24],"of":[25,54,64,118,147,155,164,205,210,218,235,241,251,268,273,288,293],"finding":[26,119,165,184],"shortest":[28,75],"(simple)":[29],"p":[31],"in":[32,81,176,196,238,266,303],"complying":[34],"with":[35,105],"additional":[37,231],"constraint":[38],"that":[39,72,115,160],"l(p)":[40,44],"\\in":[41],"L$.":[42],"Here":[43],"denotes":[45],"unique":[47],"word":[48],"obtained":[49],"by":[50,285],"concatenating":[51],"$\\Sigma$-labels":[53],"along":[57],"p.":[60],"The":[61,279],"main":[62],"contributions":[63],"this":[65],"paper":[66],"include":[67],"following:":[69],"We":[70],"show":[71,114,159],"is":[78,86,96,130,135,174,188],"solvable":[79,175],"efficiently":[80],"polynomial":[82,177],"time":[83,109,178,302],"when":[84,133],"L":[85,95,134],"restricted":[87,136],"to":[88,137,143,183],"be":[89],"context-free":[91],"(CFL).":[93],"When":[94],"specified":[97],"as":[98,248],"regular":[100,140],"we":[102,113,158,254],"provide":[103],"algorithms":[104],"improved":[106],"space":[107],"bounds.":[110],"In":[111],"contrast,":[112],"simple":[121,139,145,168,186],"between":[123,170],"source":[125,171],"given":[128,284],"destination":[129,173],"NP-hard,":[131],"even":[132],"fixed":[138],"languages":[141],"very":[144],"classes":[146],"graphs":[148],"(e.g.,":[149],"complete":[150],"grids).":[151],"For":[152,246],"class":[154],"treewidth-bounded":[156],"graphs,":[157],"(i)":[161],"regular-language-constrained":[167],"(ii)":[180],"extension":[182],"CFL-constrained":[185],"paths":[187],"NP-complete.":[189],"Our":[190],"results":[191,195,237],"extend":[192],"previous":[194,280],"[SIAM":[197],"J.":[198],"Comput.,":[199],"24":[200],"(1995),":[201],"pp.":[202,228],"1235--1258;":[203],"Proceedings":[204,217,267,287],"76th":[207,270,290],"Annual":[208,271,291],"Meeting":[209,272,292],"Transportation":[212,275,295],"Research":[213,296],"Board,":[214,277,297],"1997;":[215],"9th":[220],"ACM":[221],"SIGACT-SIGMOD-SIGART":[222],"Symposium":[223],"on":[224],"Database":[225],"Systems,":[226],"1990,":[227],"230--242].":[229],"Several":[230],"extensions":[232],"applications":[234],"our":[236,252],"context":[240],"transportation":[242],"problems":[243],"presented.":[245],"instance,":[247],"corollary":[250],"results,":[253],"obtain":[255],"polynomial-time":[257],"algorithm":[258,282],"for":[259],"best":[261,281],"k-similar":[262],"studied":[265],"Reasearch":[276],"1997].":[278],"was":[283],"[":[286],"1997]":[298],"takes":[300],"exponential":[301],"worst":[305],"case.":[306]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":13},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":14},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":8}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}