{"id":"https://openalex.org/W2154434560","doi":"https://doi.org/10.1002/net.3230040204","title":"Disjoint paths in a network","display_name":"Disjoint paths in a network","publication_year":1974,"publication_date":"1974-01-01","ids":{"openalex":"https://openalex.org/W2154434560","doi":"https://doi.org/10.1002/net.3230040204","mag":"2154434560"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230040204","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230040204","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"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/A5018143500","display_name":"J. W. Suurballe","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"J. W. Suurballe","raw_affiliation_strings":["Bell Telephone Laboratories, Inc. Holmdel, New Jersey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bell Telephone Laboratories, Inc. Holmdel, New Jersey","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5018143500"],"corresponding_institution_ids":[],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.6951,"has_fulltext":false,"cited_by_count":686,"citation_normalized_percentile":{"value":0.86104305,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"4","issue":"2","first_page":"125","last_page":"145"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10050","display_name":"Multi-Criteria Decision Making","score":0.9702000021934509,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10050","display_name":"Multi-Criteria Decision Making","score":0.9702000021934509,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9050999879837036,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9021999835968018,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.8704279661178589},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6899594068527222},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6102121472358704},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5996898412704468},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5432760119438171},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.5278030633926392},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4713415801525116},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44712692499160767},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.44070878624916077},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.4125567376613617},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40803787112236023},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3509642779827118},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.28717222809791565},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.15946409106254578},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.07277163863182068}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.8704279661178589},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6899594068527222},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6102121472358704},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5996898412704468},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5432760119438171},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.5278030633926392},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4713415801525116},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44712692499160767},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.44070878624916077},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.4125567376613617},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40803787112236023},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3509642779827118},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.28717222809791565},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.15946409106254578},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.07277163863182068},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230040204","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230040204","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"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":9,"referenced_works":["https://openalex.org/W1964119857","https://openalex.org/W2047701926","https://openalex.org/W2127470768","https://openalex.org/W2149342630","https://openalex.org/W2168736424","https://openalex.org/W2169528473","https://openalex.org/W4244424643","https://openalex.org/W4285719527","https://openalex.org/W4301216918"],"related_works":["https://openalex.org/W1519427079","https://openalex.org/W4382994290","https://openalex.org/W2354846196","https://openalex.org/W4313182153","https://openalex.org/W2348761196","https://openalex.org/W2391130892","https://openalex.org/W4361010448","https://openalex.org/W4312298416","https://openalex.org/W3121758909","https://openalex.org/W2363632570"],"abstract_inverted_index":{"Abstract":[0],"Routes":[1],"between":[2],"two":[3],"given":[4],"nodes":[5],"of":[6,42,62,88],"a":[7,58,89],"network":[8],"are":[9,14,22,83],"called":[10],"diversified":[11],"if":[12],"they":[13],"node\u2010disjoint,":[15],"except":[16],"at":[17],"the":[18,40,78],"terminals.":[19],"Diversified":[20],"routes":[21],"required":[23],"for":[24,57],"reliability":[25],"in":[26,77,85],"communication,":[27],"and":[28,52],"an":[29],"additional":[30],"criterion":[31],"is":[32,48,55],"that":[33],"their":[34],"total":[35,67],"cost,":[36],"assumed":[37],"to":[38],"be":[39],"sum":[41],"individual":[43],"arc":[44],"lengths":[45],"or":[46],"costs,":[47],"minimum.":[49],"An":[50],"algorithm":[51,70],"related":[53],"theory":[54],"described":[56],"general":[59],"number":[60],"K":[61,80,86],"node\u2010disjoint":[63,81],"paths":[64,82],"with":[65],"minimum":[66],"length.":[68],"The":[69],"applies":[71],"shortest":[72,91],"path":[73,92],"labeling":[74],"algorithms":[75],"familiar":[76],"literature.":[79],"found":[84],"iterations":[87],"single":[90],"algorithm.":[93]},"counts_by_year":[{"year":2026,"cited_by_count":6},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":20},{"year":2022,"cited_by_count":13},{"year":2021,"cited_by_count":14},{"year":2020,"cited_by_count":21},{"year":2019,"cited_by_count":18},{"year":2018,"cited_by_count":26},{"year":2017,"cited_by_count":27},{"year":2016,"cited_by_count":33},{"year":2015,"cited_by_count":48},{"year":2014,"cited_by_count":34},{"year":2013,"cited_by_count":31},{"year":2012,"cited_by_count":23}],"updated_date":"2026-04-26T08:31:28.666265","created_date":"2025-10-10T00:00:00"}