{"id":"https://openalex.org/W7139970528","doi":"https://doi.org/10.1007/s00453-026-01375-7","title":"Shortest Two Disjoint Paths in Conservative Graphs","display_name":"Shortest Two Disjoint Paths in Conservative Graphs","publication_year":2026,"publication_date":"2026-03-21","ids":{"openalex":"https://openalex.org/W7139970528","doi":"https://doi.org/10.1007/s00453-026-01375-7"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-026-01375-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-026-01375-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-026-01375-7.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-026-01375-7.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Ildik\u00f3 Schlotter","orcid":"https://orcid.org/0000-0002-0114-8280"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ildik\u00f3 Schlotter","raw_affiliation_strings":["Budapest University of Technology and Economics, Budapest, Hungary","ELTE Centre for Economic and Regional Studies, Budapest, Hungary"],"affiliations":[{"raw_affiliation_string":"Budapest University of Technology and Economics, Budapest, Hungary","institution_ids":[]},{"raw_affiliation_string":"ELTE Centre for Economic and Regional Studies, Budapest, Hungary","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.76154107,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"88","issue":"2","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.47519999742507935,"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.47519999742507935,"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.21770000457763672,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.17090000212192535,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.7685999870300293},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.550599992275238},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5130000114440918},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.48750001192092896},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4729999899864197},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4122999906539917},{"id":"https://openalex.org/keywords/weight-function","display_name":"Weight function","score":0.40610000491142273},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.37310001254081726},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.3528999984264374}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.785099983215332},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7685999870300293},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7152000069618225},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.550599992275238},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5130000114440918},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.48750001192092896},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4844000041484833},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4729999899864197},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4122999906539917},{"id":"https://openalex.org/C134466208","wikidata":"https://www.wikidata.org/wiki/Q1520657","display_name":"Weight function","level":2,"score":0.40610000491142273},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.37310001254081726},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.3528999984264374},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3458999991416931},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.34389999508857727},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.33730000257492065},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.3366999924182892},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.3346000015735626},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3303999900817871},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.32429999113082886},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3098999857902527},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2996000051498413},{"id":"https://openalex.org/C33436860","wikidata":"https://www.wikidata.org/wiki/Q341835","display_name":"Ackermann function","level":3,"score":0.2930000126361847},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.29260000586509705},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.27970001101493835},{"id":"https://openalex.org/C153658351","wikidata":"https://www.wikidata.org/wiki/Q746264","display_name":"Constant function","level":3,"score":0.2759999930858612},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.27559998631477356}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-026-01375-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-026-01375-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-026-01375-7.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00453-026-01375-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-026-01375-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-026-01375-7.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3664440726","display_name":null,"funder_award_id":"Momentum Programme (LP2021-2)","funder_id":"https://openalex.org/F4320322192","funder_display_name":"Magyar Tudom\u00e1nyos Akad\u00e9mia"}],"funders":[{"id":"https://openalex.org/F4320322192","display_name":"Magyar Tudom\u00e1nyos Akad\u00e9mia","ror":"https://ror.org/02ks8qq67"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7139970528.pdf","grobid_xml":"https://content.openalex.org/works/W7139970528.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W100926944","https://openalex.org/W1537272759","https://openalex.org/W1993496017","https://openalex.org/W2004779317","https://openalex.org/W2005079828","https://openalex.org/W2017434030","https://openalex.org/W2050579693","https://openalex.org/W2060632898","https://openalex.org/W2111716715","https://openalex.org/W2112406764","https://openalex.org/W2963908100","https://openalex.org/W2990327170","https://openalex.org/W3035520095","https://openalex.org/W4313227229"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"We":[1,112],"consider":[2],"the":[3,9,96,119,129,132],"following":[4],"problem":[5,80,124],"that":[6,117],"we":[7],"call":[8],"Shortest":[10,120],"Two":[11,121],"Disjoint":[12,122],"Paths":[13,123],"problem:":[14],"given":[15],"an":[16],"undirected":[17],"graph":[18],"$$G=(V,E)$$":[19],"<mml:math":[20,39,83],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[21,40,84],"<mml:mrow>":[22,41],"<mml:mi>G</mml:mi>":[23],"<mml:mo>=</mml:mo>":[24],"<mml:mo>(</mml:mo>":[25],"<mml:mi>V</mml:mi>":[26],"<mml:mo>,</mml:mo>":[27],"<mml:mi>E</mml:mi>":[28,44],"<mml:mo>)</mml:mo>":[29],"</mml:mrow>":[30,47],"</mml:math>":[31,48,86],"with":[32,67,108],"edge":[33],"weight":[34,97],"function":[35,98],"$${w:E\\rightarrow":[36],"\\mathbb":[37],"{R}}$$":[38],"<mml:mi>w</mml:mi>":[42],"<mml:mo>:</mml:mo>":[43],"<mml:mo>\u2192</mml:mo>":[45],"<mml:mi>R</mml:mi>":[46],",":[49,57],"two":[50,59],"terminals":[51],"s":[52,64],"and":[53,65,76],"t":[54,66],"in":[55,106,128,141],"G":[56,107,142],"find":[58],"internally":[60],"vertex-disjoint":[61],"paths":[62],"between":[63],"minimum":[68],"total":[69,110],"weight.":[70,111],"As":[71],"shown":[72],"recently":[73],"by":[74],"Schlotter":[75],"Seb\u0151":[77],"(2022),":[78],"this":[79],"becomes":[81],"$$\\textsf{NP}$$":[82],"<mml:mi>NP</mml:mi>":[85],"-hard":[87],"if":[88,95],"edges":[89,134],"can":[90],"have":[91],"negative":[92,109],"weights,":[93],"even":[94],"is":[99],"conservative,":[100],"i.e.,":[101],"there":[102],"are":[103],"no":[104],"cycles":[105],"propose":[113],"a":[114,136],"polynomial-time":[115],"algorithm":[116],"solves":[118],"for":[125],"conservative":[126],"weights":[127],"case":[130],"when":[131],"negative-weight":[133],"form":[135],"constant":[137],"number":[138],"of":[139],"trees":[140],".":[143]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}