{"id":"https://openalex.org/W2004392837","doi":"https://doi.org/10.1109/icnc.2012.6234600","title":"An algorithm for the shortest pairs of arc-disjoint paths problem","display_name":"An algorithm for the shortest pairs of arc-disjoint paths problem","publication_year":2012,"publication_date":"2012-05-01","ids":{"openalex":"https://openalex.org/W2004392837","doi":"https://doi.org/10.1109/icnc.2012.6234600","mag":"2004392837"},"language":"en","primary_location":{"id":"doi:10.1109/icnc.2012.6234600","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2012.6234600","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 8th International Conference on Natural Computation","raw_type":"proceedings-article"},"type":"conference-paper","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/A5041412322","display_name":"Zhishuai Sun","orcid":null},"institutions":[{"id":"https://openalex.org/I170215575","display_name":"National University of Defense Technology","ror":"https://ror.org/05d2yfz11","country_code":"CN","type":"education","lineage":["https://openalex.org/I170215575"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhishuai Sun","raw_affiliation_strings":["Science School, National University of Defense Technology, Changsha, China","Science school,National University of Defense Technology,Changsha 410073,China)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Science School, National University of Defense Technology, Changsha, China","institution_ids":["https://openalex.org/I170215575"]},{"raw_affiliation_string":"Science school,National University of Defense Technology,Changsha 410073,China)","institution_ids":["https://openalex.org/I170215575"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101678932","display_name":"Zheng Xie","orcid":"https://orcid.org/0009-0006-2420-7139"},"institutions":[{"id":"https://openalex.org/I170215575","display_name":"National University of Defense Technology","ror":"https://ror.org/05d2yfz11","country_code":"CN","type":"education","lineage":["https://openalex.org/I170215575"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zheng Xie","raw_affiliation_strings":["Science School, National University of Defense Technology, Changsha, China","Science school,National University of Defense Technology,Changsha 410073,China)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Science School, National University of Defense Technology, Changsha, China","institution_ids":["https://openalex.org/I170215575"]},{"raw_affiliation_string":"Science school,National University of Defense Technology,Changsha 410073,China)","institution_ids":["https://openalex.org/I170215575"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100456848","display_name":"Zhi Chen","orcid":"https://orcid.org/0000-0003-2943-9861"},"institutions":[{"id":"https://openalex.org/I170215575","display_name":"National University of Defense Technology","ror":"https://ror.org/05d2yfz11","country_code":"CN","type":"education","lineage":["https://openalex.org/I170215575"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhi Chen","raw_affiliation_strings":["Science School, National University of Defense Technology, Changsha, China","Science school,National University of Defense Technology,Changsha 410073,China)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Science School, National University of Defense Technology, Changsha, China","institution_ids":["https://openalex.org/I170215575"]},{"raw_affiliation_string":"Science school,National University of Defense Technology,Changsha 410073,China)","institution_ids":["https://openalex.org/I170215575"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5107772354","display_name":"Li Dai","orcid":"https://orcid.org/0000-0002-4075-9412"},"institutions":[{"id":"https://openalex.org/I170215575","display_name":"National University of Defense Technology","ror":"https://ror.org/05d2yfz11","country_code":"CN","type":"education","lineage":["https://openalex.org/I170215575"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Li Dai","raw_affiliation_strings":["Science School, National University of Defense Technology, Changsha, China","Science school,National University of Defense Technology,Changsha 410073,China)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Science School, National University of Defense Technology, Changsha, China","institution_ids":["https://openalex.org/I170215575"]},{"raw_affiliation_string":"Science school,National University of Defense Technology,Changsha 410073,China)","institution_ids":["https://openalex.org/I170215575"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I170215575"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"36","issue":null,"first_page":"1001","last_page":"1006"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9998999834060669,"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.9998999834060669,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9991000294685364,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9986000061035156,"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/multipath-routing","display_name":"Multipath routing","score":0.728805422782898},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7043988704681396},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6592751741409302},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5397186875343323},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5291070342063904},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.4957314431667328},{"id":"https://openalex.org/keywords/sink","display_name":"Sink (geography)","score":0.4945618808269501},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.47267135977745056},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4592655897140503},{"id":"https://openalex.org/keywords/multipath-propagation","display_name":"Multipath propagation","score":0.45328548550605774},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.42734211683273315},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2805884778499603},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.2665930688381195},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.25444239377975464},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.23330575227737427},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1729527711868286},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.16433864831924438}],"concepts":[{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.728805422782898},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7043988704681396},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6592751741409302},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5397186875343323},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5291070342063904},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4957314431667328},{"id":"https://openalex.org/C143050476","wikidata":"https://www.wikidata.org/wiki/Q194502","display_name":"Sink (geography)","level":2,"score":0.4945618808269501},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.47267135977745056},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4592655897140503},{"id":"https://openalex.org/C161218011","wikidata":"https://www.wikidata.org/wiki/Q11827794","display_name":"Multipath propagation","level":3,"score":0.45328548550605774},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.42734211683273315},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2805884778499603},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.2665930688381195},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.25444239377975464},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.23330575227737427},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1729527711868286},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.16433864831924438},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnc.2012.6234600","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2012.6234600","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 8th International Conference on Natural Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1985893635","https://openalex.org/W2024837264","https://openalex.org/W2035149461","https://openalex.org/W2047701926","https://openalex.org/W2113831372","https://openalex.org/W2124487879","https://openalex.org/W2130544995","https://openalex.org/W2154434560","https://openalex.org/W2155061423","https://openalex.org/W2168736424","https://openalex.org/W2171625696","https://openalex.org/W2359382971","https://openalex.org/W2363205537","https://openalex.org/W2390263486","https://openalex.org/W3138066533","https://openalex.org/W6679439759"],"related_works":["https://openalex.org/W1519427079","https://openalex.org/W2354846196","https://openalex.org/W4382994290","https://openalex.org/W2348761196","https://openalex.org/W2391130892","https://openalex.org/W4361010448","https://openalex.org/W3121758909","https://openalex.org/W2392078542","https://openalex.org/W2184939461","https://openalex.org/W4293054712"],"abstract_inverted_index":{"Multipath":[0],"Routing":[1],"plays":[2],"an":[3,40],"important":[4,41],"role":[5],"in":[6,64,81],"satellite":[7],"network":[8,104],"and":[9,23,94],"computer":[10],"communication":[11],"network.":[12],"It":[13],"can":[14],"increase":[15],"the":[16,25,44,53,56,79,87,95,103],"reliability":[17],"of":[18,27,36,43,59,89],"a":[19,100],"network,":[20],"avoid":[21],"congestion":[22],"reduce":[24],"probability":[26],"dropped":[28],"packets.":[29],"The":[30],"algorithm":[31,54],"for":[32,55],"finding":[33],"shortest":[34,57],"pairs":[35,58,88],"arc-disjoint":[37,60],"paths":[38,61,90],"is":[39,105],"part":[42],"multipath":[45],"routing.":[46],"In":[47],"this":[48],"paper,":[49],"we":[50,77,83,98],"first":[51],"introduce":[52],"problem":[62],"(SADPP)":[63],"networks":[65],"which":[66,82],"contain":[67],"one":[68,71],"sink":[69],"with":[70],"source":[72],"or":[73],"several":[74],"sources,":[75],"then,":[76],"discuss":[78],"case":[80],"need":[84],"to":[85],"find":[86],"between":[91],"any":[92],"vertex":[93],"sink.":[96],"Finally,":[97],"present":[99],"method":[101],"when":[102],"time-dependent.":[106]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}