{"id":"https://openalex.org/W2808374365","doi":"https://doi.org/10.24963/ijcai.2018/202","title":"A Fast Algorithm for Optimally Finding Partially Disjoint Shortest Paths","display_name":"A Fast Algorithm for Optimally Finding Partially Disjoint Shortest Paths","publication_year":2018,"publication_date":"2018-07-01","ids":{"openalex":"https://openalex.org/W2808374365","doi":"https://doi.org/10.24963/ijcai.2018/202","mag":"2808374365"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2018/202","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2018/202","pdf_url":"https://www.ijcai.org/proceedings/2018/0202.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.ijcai.org/proceedings/2018/0202.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013126405","display_name":"Longkun Guo","orcid":"https://orcid.org/0000-0003-2891-4253"},"institutions":[{"id":"https://openalex.org/I80947539","display_name":"Fuzhou University","ror":"https://ror.org/011xvna82","country_code":"CN","type":"education","lineage":["https://openalex.org/I80947539"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Longkun Guo","raw_affiliation_strings":["College of Mathematics and Computer Science, Fuzhou University","College of Mathematics and Computer Science, Fuzhou University, Fuzhou 350116, Fujian, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Mathematics and Computer Science, Fuzhou University","institution_ids":["https://openalex.org/I80947539"]},{"raw_affiliation_string":"College of Mathematics and Computer Science, Fuzhou University, Fuzhou 350116, Fujian, China","institution_ids":["https://openalex.org/I80947539"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048231803","display_name":"Yunyun Deng","orcid":null},"institutions":[{"id":"https://openalex.org/I80947539","display_name":"Fuzhou University","ror":"https://ror.org/011xvna82","country_code":"CN","type":"education","lineage":["https://openalex.org/I80947539"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yunyun Deng","raw_affiliation_strings":["College of Mathematics and Computer Science, Fuzhou University","College of Mathematics and Computer Science, Fuzhou University, Fuzhou 350116, Fujian, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Mathematics and Computer Science, Fuzhou University","institution_ids":["https://openalex.org/I80947539"]},{"raw_affiliation_string":"College of Mathematics and Computer Science, Fuzhou University, Fuzhou 350116, Fujian, China","institution_ids":["https://openalex.org/I80947539"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081316307","display_name":"Kewen Liao","orcid":"https://orcid.org/0000-0003-0371-6525"},"institutions":[{"id":"https://openalex.org/I57093077","display_name":"Swinburne University of Technology","ror":"https://ror.org/031rekg67","country_code":"AU","type":"education","lineage":["https://openalex.org/I57093077"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Kewen Liao","raw_affiliation_strings":["Department of Computer Science and Software Engineering, Swinburne University","Department of Computer Science and Software Engineering, Swinburne University, VIC, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Software Engineering, Swinburne University","institution_ids":["https://openalex.org/I57093077"]},{"raw_affiliation_string":"Department of Computer Science and Software Engineering, Swinburne University, VIC, Australia","institution_ids":["https://openalex.org/I57093077"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023499987","display_name":"Qiang He","orcid":"https://orcid.org/0000-0002-2607-4556"},"institutions":[{"id":"https://openalex.org/I57093077","display_name":"Swinburne University of Technology","ror":"https://ror.org/031rekg67","country_code":"AU","type":"education","lineage":["https://openalex.org/I57093077"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Qiang He","raw_affiliation_strings":["Department of Computer Science and Software Engineering, Swinburne University","Department of Computer Science and Software Engineering, Swinburne University, VIC, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Software Engineering, Swinburne University","institution_ids":["https://openalex.org/I57093077"]},{"raw_affiliation_string":"Department of Computer Science and Software Engineering, Swinburne University, VIC, Australia","institution_ids":["https://openalex.org/I57093077"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020449921","display_name":"Timos Sellis","orcid":"https://orcid.org/0000-0002-9067-5639"},"institutions":[{"id":"https://openalex.org/I57093077","display_name":"Swinburne University of Technology","ror":"https://ror.org/031rekg67","country_code":"AU","type":"education","lineage":["https://openalex.org/I57093077"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Timos Sellis","raw_affiliation_strings":["Department of Computer Science and Software Engineering, Swinburne University","Department of Computer Science and Software Engineering, Swinburne University, VIC, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Software Engineering, Swinburne University","institution_ids":["https://openalex.org/I57093077"]},{"raw_affiliation_string":"Department of Computer Science and Software Engineering, Swinburne University, VIC, Australia","institution_ids":["https://openalex.org/I57093077"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064090634","display_name":"Zheshan Hu","orcid":null},"institutions":[{"id":"https://openalex.org/I80947539","display_name":"Fuzhou University","ror":"https://ror.org/011xvna82","country_code":"CN","type":"education","lineage":["https://openalex.org/I80947539"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zheshan Hu","raw_affiliation_strings":["College of Mathematics and Computer Science, Fuzhou University","College of Mathematics and Computer Science, Fuzhou University, Fuzhou 350116, Fujian, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Mathematics and Computer Science, Fuzhou University","institution_ids":["https://openalex.org/I80947539"]},{"raw_affiliation_string":"College of Mathematics and Computer Science, Fuzhou University, Fuzhou 350116, Fujian, China","institution_ids":["https://openalex.org/I80947539"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":6,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0475,"has_fulltext":true,"cited_by_count":17,"citation_normalized_percentile":{"value":0.78245475,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1456","last_page":"1462"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.996999979019165,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9958000183105469,"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/disjoint-sets","display_name":"Disjoint sets","score":0.7360522747039795},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6854392886161804},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6373727321624756},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.6041362285614014},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5513189435005188},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4986903667449951},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4978303909301758},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.4223296642303467},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4201664626598358},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.41369274258613586},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4009940028190613},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40040838718414307},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.396487295627594},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3937990665435791},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.37799912691116333},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.30824780464172363}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7360522747039795},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6854392886161804},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6373727321624756},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.6041362285614014},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5513189435005188},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4986903667449951},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4978303909301758},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.4223296642303467},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4201664626598358},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.41369274258613586},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4009940028190613},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40040838718414307},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.396487295627594},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3937990665435791},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.37799912691116333},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.30824780464172363},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.24963/ijcai.2018/202","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2018/202","pdf_url":"https://www.ijcai.org/proceedings/2018/0202.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},{"id":"pmh:oai:researchbank.acu.edu.au:flb_pub-2243","is_oa":false,"landing_page_url":"https://researchbank.acu.edu.au/flb_pub/1244","pdf_url":null,"source":{"id":"https://openalex.org/S4306401783","display_name":"Research Bank (Australian Catholic University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I86695891","host_organization_name":"Australian Catholic University","host_organization_lineage":["https://openalex.org/I86695891"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Faculty of Law and Business Publications","raw_type":"text"},{"id":"pmh:oai:figshare.com:article/28340315","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference contribution"},{"id":"pmh:oai:researchbank.swinburne.edu.au:e3deb91a-17c0-4330-91dc-0b081381bc2d/1","is_oa":false,"landing_page_url":"http://hdl.handle.net/1959.3/445010","pdf_url":null,"source":{"id":"https://openalex.org/S4306401157","display_name":"Swinburne Research Bank (Swinburne University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I57093077","host_organization_name":"Swinburne University of Technology","host_organization_lineage":["https://openalex.org/I57093077"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI-18), Stockholm, 13-19 July 2018 / Jerome Lang (ed.), pp. 1456-1462","raw_type":""}],"best_oa_location":{"id":"doi:10.24963/ijcai.2018/202","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2018/202","pdf_url":"https://www.ijcai.org/proceedings/2018/0202.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[{"score":0.5299999713897705,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[{"id":"https://openalex.org/G161743296","display_name":null,"funder_award_id":"61772005","funder_id":"https://openalex.org/F4320321878","funder_display_name":"Natural Science Foundation of Fujian Province"},{"id":"https://openalex.org/G1715651473","display_name":null,"funder_award_id":"61772005","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G2260253448","display_name":null,"funder_award_id":"2017J01753","funder_id":"https://openalex.org/F4320321878","funder_display_name":"Natural Science Foundation of Fujian Province"},{"id":"https://openalex.org/G2527507928","display_name":null,"funder_award_id":"61300025","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320321878","display_name":"Natural Science Foundation of Fujian Province","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2808374365.pdf","grobid_xml":"https://content.openalex.org/works/W2808374365.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W328847996","https://openalex.org/W748479430","https://openalex.org/W1977545325","https://openalex.org/W1999867351","https://openalex.org/W2011334641","https://openalex.org/W2022191808","https://openalex.org/W2058479406","https://openalex.org/W2069159763","https://openalex.org/W2074117023","https://openalex.org/W2130626677","https://openalex.org/W2154434560","https://openalex.org/W2154571828","https://openalex.org/W2155061423","https://openalex.org/W2161591474","https://openalex.org/W2258927119","https://openalex.org/W2515641369","https://openalex.org/W2556411342","https://openalex.org/W2562195265","https://openalex.org/W2578956555","https://openalex.org/W3214428327","https://openalex.org/W4232231123","https://openalex.org/W4246219036","https://openalex.org/W6679591615","https://openalex.org/W6683050674"],"related_works":["https://openalex.org/W2018146256","https://openalex.org/W2237480599","https://openalex.org/W2133099431","https://openalex.org/W2002764510","https://openalex.org/W2198982833","https://openalex.org/W4293054712","https://openalex.org/W2779966368","https://openalex.org/W2348504720","https://openalex.org/W2183791707","https://openalex.org/W2074459488"],"abstract_inverted_index":{"The":[0,147],"classical":[1],"disjoint":[2,31,45,84,107],"shortest":[3,24,46,79,108],"path":[4],"problem":[5,75,100,136],"has":[6],"recently":[7],"recalled":[8],"interests":[9],"from":[10],"researchers":[11],"in":[12,41,48,95],"the":[13,20,23,74,99,135,143,176,179],"network":[14,67,97],"planning":[15],"and":[16,36,65,159],"optimization":[17],"community.":[18],"However,":[19],"requirement":[21],"of":[22,53,63,76,92,117,167,172,178],"paths":[25,80,109],"being":[26],"completely":[27],"vertex":[28,87],"or":[29,56],"edge":[30,83,106],"might":[32],"be":[33],"too":[34],"restrictive":[35],"demands":[37],"much":[38],"more":[39],"resources":[40],"a":[42,50,90,96,114,138],"network.":[43],"Partially":[44],"paths,":[47],"which":[49,81,111,162],"bounded":[51,115],"number":[52,116],"shared":[54,120],"vertices":[55,94,118],"edges":[57],"is":[58,150],"allowed,":[59],"balance":[60],"between":[61],"degree":[62],"disjointness":[64],"occupied":[66],"resources.":[68],"In":[69,126],"this":[70],"paper,":[71],"we":[72,128],"consider":[73],"finding":[77],"k":[78,105],"are":[82,119],"but":[85],"partially":[86],"disjoint.":[88],"For":[89],"pair":[91],"distinct":[93],"graph,":[98],"aims":[101],"to":[102,169],"optimally":[103],"find":[104],"among":[110],"at":[112,122],"most":[113],"by":[121,153],"least":[123],"two":[124],"paths.":[125],"particular,":[127],"present":[129],"novel":[130],"techniques":[131],"for":[132],"exactly":[133],"solving":[134],"with":[137],"runtime":[139],"that":[140],"significantly":[141],"improves":[142],"current":[144],"best":[145],"result.":[146],"proposed":[148],"algorithm":[149],"also":[151],"validated":[152],"computer":[154],"experiments":[155],"on":[156],"both":[157],"synthetic":[158],"real":[160],"networks":[161],"demonstrate":[163],"its":[164],"superior":[165],"efficiency":[166],"up":[168],"three":[170],"orders":[171],"magnitude":[173],"faster":[174],"than":[175],"state":[177],"art.":[180]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}