{"id":"https://openalex.org/W2155061423","doi":"https://doi.org/10.1002/net.3230140209","title":"A quick method for finding shortest pairs of disjoint paths","display_name":"A quick method for finding shortest pairs of disjoint paths","publication_year":1984,"publication_date":"1984-06-01","ids":{"openalex":"https://openalex.org/W2155061423","doi":"https://doi.org/10.1002/net.3230140209","mag":"2155061423"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230140209","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230140209","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 Laboratories, West Long Branch, New Jersey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bell Laboratories, West Long Branch, New Jersey","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051027549","display_name":"Robert E. Tarjan","orcid":"https://orcid.org/0000-0001-7505-5768"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R. E. Tarjan","raw_affiliation_strings":["Bell Laboratories, Murray Hill, New Jersey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bell Laboratories, Murray Hill, New Jersey","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5018143500"],"corresponding_institution_ids":[],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":2.1758,"has_fulltext":false,"cited_by_count":693,"citation_normalized_percentile":{"value":0.88689339,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"14","issue":"2","first_page":"325","last_page":"336"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9984999895095825,"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.9984999895095825,"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.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/T12176","display_name":"Optimization and Packing Problems","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/combinatorics","display_name":"Combinatorics","score":0.7690144777297974},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7151244878768921},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5771914124488831},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5454663634300232},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.47994258999824524},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.47392210364341736},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4681428074836731},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4324128031730652},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.42601585388183594},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3838469982147217},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.3183669447898865},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.28471603989601135},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.08559143543243408}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7690144777297974},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7151244878768921},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5771914124488831},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5454663634300232},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.47994258999824524},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.47392210364341736},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4681428074836731},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4324128031730652},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.42601585388183594},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3838469982147217},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3183669447898865},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.28471603989601135},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.08559143543243408},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230140209","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230140209","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1513400187","https://openalex.org/W1655990431","https://openalex.org/W1963503748","https://openalex.org/W2022980325","https://openalex.org/W2049105156","https://openalex.org/W2125690626","https://openalex.org/W2154434560","https://openalex.org/W2169528473","https://openalex.org/W2569646339"],"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/W2392078542"],"abstract_inverted_index":{"Abstract":[0],"Let":[1],"G":[2],"be":[3],"a":[4,14,24,40],"directed":[5],"graph":[6],"containing":[7],"n":[8,60,63,86,103],"vertices,":[9],"one":[10],"of":[11,31,42,49,73,101,105,118],"which":[12],"is":[13,124],"distinguished":[15],"source":[16],"s":[17,46],",":[18,39],"and":[19,89],"m":[20,81,92],"edges,":[21],"each":[22,34],"with":[23],"non\u2010negative":[25],"cost.":[26,53],"We":[27,69],"consider":[28],"the":[29,102,110,116,130],"problem":[30],"finding,":[32],"for":[33,66,120],"possible":[35],"sink":[36,123],"vertex":[37],"v":[38,48],"pair":[41,117],"edge\u2010disjoint":[43],"paths":[44,119],"from":[45],"to":[47,113],"minimum":[50],"total":[51],"edge":[52,128],"Suurballe":[54],"has":[55],"given":[56,107,122],"an":[57,71,98],"O":[58,79,90,125],"(":[59,80,91],"2":[61],"log":[62],")\u2010time":[64],"algorithm":[65,75,96],"this":[67,108],"problem.":[68],"give":[70],"implementation":[72],"Suurballe's":[74],"that":[76],"runs":[77],"in":[78],"log(":[82],"1+":[83],"m/n":[84],")":[85,87,93],"time":[88,111],"space.":[94],"Our":[95],"builds":[97],"implicit":[99],"representation":[100],"pairs":[104],"paths;":[106],"representation,":[109],"necessary":[112],"explicitly":[114],"construct":[115],"any":[121],"(1)":[126],"per":[127],"on":[129],"paths.":[131]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":23},{"year":2023,"cited_by_count":12},{"year":2022,"cited_by_count":14},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":19},{"year":2019,"cited_by_count":14},{"year":2018,"cited_by_count":23},{"year":2017,"cited_by_count":25},{"year":2016,"cited_by_count":26},{"year":2015,"cited_by_count":41},{"year":2014,"cited_by_count":50},{"year":2013,"cited_by_count":35},{"year":2012,"cited_by_count":46}],"updated_date":"2026-05-21T09:19:25.381259","created_date":"2025-10-10T00:00:00"}