{"id":"https://openalex.org/W2132604643","doi":null,"title":"On labeled paths","display_name":"On labeled paths","alternate_titles":[],"publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2132604643","mag":"2132604643"},"language":"en","primary_location":{"id":"mag:2132604643","doi":null,"is_oa":false,"landing_page_url":"http://acumen.lib.ua.edu/content/u0015/0000001/0000258/u0015_0000001_0000258.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2132604643"],"child_works_count":0,"type":"dissertation","is_traditional":true,"indexed_in":[],"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/A5030385468","display_name":"Richard B. Borie","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I17301866","display_name":"University of Alabama","ror":"https://ror.org/03xrrjk67","country_code":"US","type":"education","lineage":["https://openalex.org/I17301866"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Richard Borie","raw_affiliation_strings":["The University of Alabama"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Alabama","institution_ids":["https://openalex.org/I17301866"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021552385","display_name":"Nathan M. Wiegand","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I17301866","display_name":"University of Alabama","ror":"https://ror.org/03xrrjk67","country_code":"US","type":"education","lineage":["https://openalex.org/I17301866"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nathan M. Wiegand","raw_affiliation_strings":["The University of Alabama"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Alabama","institution_ids":["https://openalex.org/I17301866"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I17301866"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.8300999999046326,"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.8300999999046326,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.09950000047683716,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.041200000792741776,"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/context-free-languages","display_name":"context-free languages","score":0.6970000267028809},{"id":"https://openalex.org/keywords/all-pairs-shortest-paths","display_name":"all-pairs shortest paths","score":0.8629999756813049},{"id":"https://openalex.org/keywords/mapreduce","display_name":"MapReduce","score":0.9470000267028809},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.527999997138977},{"id":"https://openalex.org/keywords/formal-languages","display_name":"formal languages","score":0.8019999861717224},{"id":"https://openalex.org/keywords/automata-theory","display_name":"automata theory","score":0.8220000267028809}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6765261888504028},{"id":"https://openalex.org/C146072743","wikidata":"https://www.wikidata.org/wiki/Q192161","display_name":"Formal language","level":2,"score":0.6551614999771118},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.6503050327301025},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.6188571453094482},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.569998025894165},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5639460682868958},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5225983262062073},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.4966586232185364},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.4886925518512726},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.445151686668396},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.425438791513443},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41610297560691833},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38437244296073914},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3808900713920593},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37639477849006653},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.12750095129013062},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07944473624229431},{"id":"https://openalex.org/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:2132604643","doi":null,"is_oa":false,"landing_page_url":"http://acumen.lib.ua.edu/content/u0015/0000001/0000258/u0015_0000001_0000258.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"pmh:oai:pqdtoai.proquest.com:3409129","doi":null,"is_oa":false,"landing_page_url":"http://pqdtopen.proquest.com/#viewpdf?dispub=3409129","pdf_url":"http://pqdtopen.proquest.com/#viewpdf?dispub=3409129","source":{"id":"https://openalex.org/S7407064308","display_name":"ProQuest Demo Repository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"thesis"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W196672294","https://openalex.org/W1481677469","https://openalex.org/W1526841711","https://openalex.org/W1549911051","https://openalex.org/W1583825963","https://openalex.org/W1967140769","https://openalex.org/W1970026646","https://openalex.org/W2003250112","https://openalex.org/W2007572995","https://openalex.org/W2011039300","https://openalex.org/W2011824721","https://openalex.org/W2014364434","https://openalex.org/W2022980325","https://openalex.org/W2027594761","https://openalex.org/W2030166143","https://openalex.org/W2033356880","https://openalex.org/W2036666387","https://openalex.org/W2058426370","https://openalex.org/W2080063509","https://openalex.org/W2080540417","https://openalex.org/W2084224084","https://openalex.org/W2098278777","https://openalex.org/W2101771805","https://openalex.org/W2121821841","https://openalex.org/W2151021662","https://openalex.org/W2162945593","https://openalex.org/W2163097371","https://openalex.org/W2173213060","https://openalex.org/W2227557434","https://openalex.org/W2478722229","https://openalex.org/W3143219376","https://openalex.org/W3145128584"],"related_works":["https://openalex.org/W2287802073","https://openalex.org/W1278327871","https://openalex.org/W7097373060","https://openalex.org/W7095084774","https://openalex.org/W2145607287","https://openalex.org/W2098278777","https://openalex.org/W7095842702","https://openalex.org/W1533159348","https://openalex.org/W7095194097","https://openalex.org/W2146583842"],"abstract_inverted_index":{"Labeled":[0],"graph":[1],"theory":[2,14],"is":[3,91,110],"the":[4,34,43,66,78,84,96,99,104,108,114,119,132],"marriage":[5],"of":[6,31,45,56,80,98,113,131],"two":[7,57],"common":[8],"problem":[9],"domains":[10],"to":[11],"computer":[12],"science\u2014graph":[13],"and":[15,71],"automata":[16],"theory.":[17],"Though":[18],"each":[19,129],"has":[20,27],"been":[21,28],"independently":[22],"studied":[23],"in":[24,42,77],"depth,":[25],"there":[26],"little":[29],"investigation":[30],"their":[32],"intersection,":[33],"labeled":[35,46,59,75,124],"paths.":[36],"This":[37],"dissertation":[38],"examines":[39],"three":[40],"results":[41,73],"area":[44],"path":[47,102,109],"problems.":[48],"The":[49,69,88],"first":[50],"result":[51,90,121],"presents":[52,122],"an":[53],"empirical":[54],"analysis":[55],"context-free":[58],"all-pairs":[60,125],"shortest-path":[61,126],"algorithms":[62],"using":[63],"MapReduce":[64],"as":[65],"experimental":[67],"platform.":[68],"second":[70,89],"third":[72,120],"examine":[74],"paths":[76],"context":[79,85],"formal":[81,105],"languages":[82],"beyond":[83],"free":[86],"languages.":[87],"a":[92,111,123],"lower":[93],"bound":[94],"on":[95],"length":[97],"longest":[100],"shortest":[101],"when":[103],"language":[106,116],"constraining":[107],"member":[112],"control":[115],"hierarchy.":[117],"Finally,":[118],"algorithm":[127],"for":[128],"level":[130],"infinite":[133],"KLinear-Hierarchy.":[134]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2132604643","counts_by_year":[],"updated_date":"2026-11-15T12:55:33.944570","created_date":"2016-06-24T00:00:00"}
