{"id":"https://openalex.org/W4200143897","doi":"https://doi.org/10.3390/a14120367","title":"A Pathfinding Problem for Fork-Join Directed Acyclic Graphs with Unknown Edge Length","display_name":"A Pathfinding Problem for Fork-Join Directed Acyclic Graphs with Unknown Edge Length","publication_year":2021,"publication_date":"2021-12-17","ids":{"openalex":"https://openalex.org/W4200143897","doi":"https://doi.org/10.3390/a14120367"},"language":"en","primary_location":{"id":"doi:10.3390/a14120367","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14120367","pdf_url":"https://www.mdpi.com/1999-4893/14/12/367/pdf?version=1639745252","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/14/12/367/pdf?version=1639745252","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073091856","display_name":"Kunihiko Hiraishi","orcid":"https://orcid.org/0000-0003-1750-1891"},"institutions":[{"id":"https://openalex.org/I177738480","display_name":"Japan Advanced Institute of Science and Technology","ror":"https://ror.org/03frj4r98","country_code":"JP","type":"education","lineage":["https://openalex.org/I177738480"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Kunihiko Hiraishi","raw_affiliation_strings":["School of Information Science, Japan Advanced Institute of Science and Technology, 1-1 Asahiday, Nomi 923-1292, Ishikawa, Japan"],"affiliations":[{"raw_affiliation_string":"School of Information Science, Japan Advanced Institute of Science and Technology, 1-1 Asahiday, Nomi 923-1292, Ishikawa, Japan","institution_ids":["https://openalex.org/I177738480"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5073091856"],"corresponding_institution_ids":["https://openalex.org/I177738480"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18710542,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"14","issue":"12","first_page":"367","last_page":"367"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9889000058174133,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9889000058174133,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9872000217437744,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9801999926567078,"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/join","display_name":"Join (topology)","score":0.7234821319580078},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.6685534119606018},{"id":"https://openalex.org/keywords/fork","display_name":"Fork (system call)","score":0.6369487643241882},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5713247656822205},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5553021430969238},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.5449627041816711},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.49166685342788696},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4738377034664154},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4594183564186096},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4260368347167969},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07634279131889343}],"concepts":[{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.7234821319580078},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.6685534119606018},{"id":"https://openalex.org/C40523978","wikidata":"https://www.wikidata.org/wiki/Q14675","display_name":"Fork (system call)","level":2,"score":0.6369487643241882},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5713247656822205},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5553021430969238},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.5449627041816711},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.49166685342788696},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4738377034664154},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4594183564186096},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4260368347167969},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07634279131889343},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a14120367","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14120367","pdf_url":"https://www.mdpi.com/1999-4893/14/12/367/pdf?version=1639745252","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:93883f5cdfb84c3299003eec3174ba10","is_oa":true,"landing_page_url":"https://doaj.org/article/93883f5cdfb84c3299003eec3174ba10","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 14, Iss 12, p 367 (2021)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/14/12/367/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a14120367","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 14; Issue 12; Pages: 367","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a14120367","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14120367","pdf_url":"https://www.mdpi.com/1999-4893/14/12/367/pdf?version=1639745252","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4200143897.pdf","grobid_xml":"https://content.openalex.org/works/W4200143897.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W4260767","https://openalex.org/W1531947739","https://openalex.org/W1538209031","https://openalex.org/W1581520665","https://openalex.org/W1969483458","https://openalex.org/W1971095127","https://openalex.org/W1994091315","https://openalex.org/W2046406644","https://openalex.org/W2122967662","https://openalex.org/W2138637686","https://openalex.org/W2150470619","https://openalex.org/W2796967789","https://openalex.org/W2944077012","https://openalex.org/W3084669832","https://openalex.org/W6601538878","https://openalex.org/W6636025607","https://openalex.org/W6678504297"],"related_works":["https://openalex.org/W2146569528","https://openalex.org/W1998712144","https://openalex.org/W4287028074","https://openalex.org/W4214487273","https://openalex.org/W2106828717","https://openalex.org/W3191289342","https://openalex.org/W4300165677","https://openalex.org/W4297817344","https://openalex.org/W4292730466","https://openalex.org/W2372211403"],"abstract_inverted_index":{"In":[0,50,82],"a":[1,7,22,38,59],"previous":[2,80,97],"paper":[3,90,98],"by":[4,37],"the":[5,16,27,47,53,73,79,84,96],"author,":[6],"pathfinding":[8],"problem":[9,55,71],"for":[10,58,72,103],"directed":[11,67],"trees":[12],"is":[13,29,56,91,100],"studied":[14,57],"under":[15],"following":[17],"situation:":[18],"each":[19],"edge":[20],"has":[21],"nonnegative":[23],"integer":[24],"length,":[25],"but":[26],"length":[28,48],"unknown":[30],"in":[31,88,95],"advance":[32],"and":[33,99],"should":[34],"be":[35],"found":[36],"procedure":[39],"whose":[40],"computational":[41],"cost":[42],"becomes":[43],"exponentially":[44],"larger":[45],"as":[46],"increases.":[49],"this":[51,89],"paper,":[52],"same":[54],"more":[60,101],"general":[61],"class":[62,75],"of":[63,76],"graphs":[64,77],"called":[65],"fork-join":[66],"acyclic":[68],"graphs.":[69],"The":[70],"new":[74],"contains":[78],"one.":[81],"addition,":[83],"optimality":[85],"criterion":[86],"used":[87],"stronger":[92],"than":[93],"that":[94],"appropriate":[102],"real":[104],"applications.":[105]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}