{"id":"https://openalex.org/W3206785324","doi":"https://doi.org/10.1142/s021926592150016x","title":"Maintaining Constrained Path Problem for Directed Acyclic Graphs","display_name":"Maintaining Constrained Path Problem for Directed Acyclic Graphs","publication_year":2021,"publication_date":"2021-09-01","ids":{"openalex":"https://openalex.org/W3206785324","doi":"https://doi.org/10.1142/s021926592150016x","mag":"3206785324"},"language":"en","primary_location":{"id":"doi:10.1142/s021926592150016x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s021926592150016x","pdf_url":null,"source":{"id":"https://openalex.org/S63112013","display_name":"Journal of Interconnection Networks","issn_l":"0219-2659","issn":["0219-2659","1793-6713"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Interconnection Networks","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/A5070167656","display_name":"Chenying Hao","orcid":null},"institutions":[{"id":"https://openalex.org/I9086337","display_name":"Taiyuan University of Technology","ror":"https://ror.org/03kv08d37","country_code":"CN","type":"education","lineage":["https://openalex.org/I9086337"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chenying Hao","raw_affiliation_strings":["College of Mathematics, Taiyuan University of Technology, Taiyuan, Shanxi 030024, P. R. China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Mathematics, Taiyuan University of Technology, Taiyuan, Shanxi 030024, P. R. China","institution_ids":["https://openalex.org/I9086337"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038528725","display_name":"Shurong Zhang","orcid":"https://orcid.org/0000-0001-7734-1039"},"institutions":[{"id":"https://openalex.org/I9086337","display_name":"Taiyuan University of Technology","ror":"https://ror.org/03kv08d37","country_code":"CN","type":"education","lineage":["https://openalex.org/I9086337"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shurong Zhang","raw_affiliation_strings":["College of Mathematics, Taiyuan University of Technology, Taiyuan, Shanxi 030024, P. R. China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Mathematics, Taiyuan University of Technology, Taiyuan, Shanxi 030024, P. R. China","institution_ids":["https://openalex.org/I9086337"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113891028","display_name":"Weihua Yang","orcid":null},"institutions":[{"id":"https://openalex.org/I9086337","display_name":"Taiyuan University of Technology","ror":"https://ror.org/03kv08d37","country_code":"CN","type":"education","lineage":["https://openalex.org/I9086337"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Weihua Yang","raw_affiliation_strings":["College of Mathematics, Taiyuan University of Technology, Taiyuan, Shanxi 030024, P. R. China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Mathematics, Taiyuan University of Technology, Taiyuan, Shanxi 030024, P. R. China","institution_ids":["https://openalex.org/I9086337"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19006502,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"21","issue":"03","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9952999949455261,"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.9952999949455261,"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.9940000176429749,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9894000291824341,"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/longest-path-problem","display_name":"Longest path problem","score":0.6957203149795532},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6178452372550964},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.608778715133667},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6085427403450012},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.6085022687911987},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.596903383731842},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.49159106612205505},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45533034205436707},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43987587094306946},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42266497015953064},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.42024290561676025},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38190212845802307},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.35345327854156494}],"concepts":[{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.6957203149795532},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6178452372550964},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.608778715133667},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6085427403450012},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.6085022687911987},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.596903383731842},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.49159106612205505},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45533034205436707},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43987587094306946},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42266497015953064},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.42024290561676025},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38190212845802307},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35345327854156494},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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.1142/s021926592150016x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s021926592150016x","pdf_url":null,"source":{"id":"https://openalex.org/S63112013","display_name":"Journal of Interconnection Networks","issn_l":"0219-2659","issn":["0219-2659","1793-6713"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Interconnection Networks","raw_type":"journal-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/W1604909471","https://openalex.org/W1967389135","https://openalex.org/W1989111470","https://openalex.org/W1997781700","https://openalex.org/W2017771487","https://openalex.org/W2029706450","https://openalex.org/W2044712659","https://openalex.org/W2049354208","https://openalex.org/W2061701207","https://openalex.org/W2063896698","https://openalex.org/W2071845176","https://openalex.org/W2084224084","https://openalex.org/W2087989168","https://openalex.org/W2094826544","https://openalex.org/W2112379074","https://openalex.org/W2135810626","https://openalex.org/W2169528473","https://openalex.org/W2192308205","https://openalex.org/W2802569726"],"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/W4382866750","https://openalex.org/W4293167680","https://openalex.org/W4297817344"],"abstract_inverted_index":{"In":[0,74],"order":[1],"to":[2,91,113,122,181,198],"restore":[3],"the":[4,13,54,79,93,120,135,139,152,165,178,186],"faulty":[5,29,103],"path":[6,16,55,125,142,154,174],"in":[7,185],"network":[8],"more":[9],"effectively,":[10],"we":[11,45,77,169],"propose":[12],"maintaining":[14,53,172],"constrained":[15,124,173],"problem.":[17],"Give":[18],"a":[19,117,171],"directed":[20],"acyclic":[21],"graph":[22],"(DAG)":[23],"[Formula:":[24,32,35,42,59,64,71,81,85,147,159,182,195,199],"see":[25,33,36,43,60,65,72,82,86,148,160,183,196,200],"text]":[26,61,66,83,87,149,161,184,197,201],"with":[27,67,138,144,156],"some":[28],"edges,":[30,104],"where":[31],"text],":[34,44],"text].":[37,73],"For":[38],"any":[39],"positive":[40],"number":[41],"give":[46],"effective":[47],"maintain":[48],"algorithm":[49,143,155,166,175],"for":[50,167],"finding":[51],"and":[52,62,84,97,115,151,176],"between":[56],"source":[57],"vertex":[58,194],"destination":[63],"length":[68],"at":[69],"most":[70],"this":[75,110],"paper,":[76],"consider":[78],"parameters":[80],"which":[88,99,128],"are":[89,100],"used":[90],"measure":[92],"numbers":[94],"of":[95,109],"edges":[96],"vertices":[98],"influenced":[101],"by":[102],"respectively.":[105],"The":[106],"main":[107],"technique":[108],"paper":[111],"is":[112],"define":[114],"solve":[116],"subproblem":[118],"called":[119],"one":[121],"set":[123],"problem":[126],"(OSCPP)":[127],"has":[129],"not":[130],"been":[131,203],"addressed":[132],"before.":[133],"On":[134],"DAG,":[136],"compared":[137],"dynamic":[140],"shortest":[141,153,190],"time":[145,157,179],"complexity":[146,158,180],"[16]":[150],"[18],":[162],"based":[163],"on":[164],"OSCPP,":[168],"develop":[170],"improve":[177],"case":[187],"that":[188],"all":[189],"paths":[191],"from":[192],"each":[193],"have":[202],"given.":[204]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}