The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths

This paper revisits the classical edge-disjoint paths (EDP) problem, where one is given an undirected graph G and a set of terminal pairs P and asks whether G contains a set of pairwise edge-disjoint paths connecting every terminal pair in P . Our aim is to identify structural properties (parameters...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 83; no. 2; pp. 726 - 752
Main Authors:	Ganian, Robert, Ordyniak, Sebastian
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.02.2021 Springer Nature B.V
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Cut width Data Structures and Information Theory Graphs Mathematics of Computing Parameter identification Parameterization Polynomials Separators Theory of Computation Edge-disjoint path problem Tree-cut width Feedback edge set Parameterized complexity
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	This paper revisits the classical edge-disjoint paths (EDP) problem, where one is given an undirected graph G and a set of terminal pairs P and asks whether G contains a set of pairwise edge-disjoint paths connecting every terminal pair in P . Our aim is to identify structural properties (parameters) of graphs which allow the efficient solution of EDP without restricting the placement of terminals in P in any way. In this setting, EDP is known to remain NP-hard even on extremely restricted graph classes, such as graphs with a vertex cover of size 3. We present three results which use edge-separator based parameters to chart new islands of tractability in the complexity landscape of EDP. Our first and main result utilizes the fairly recent structural parameter tree-cut width (a parameter with fundamental ties to graph immersions and graph cuts): we obtain a polynomial-time algorithm for EDP on every graph class of bounded tree-cut width. Our second result shows that EDP parameterized by tree-cut width is unlikely to be fixed-parameter tractable. Our final, third result is a polynomial kernel for EDP parameterized by the size of a minimum feedback edge set in the graph.
AbstractList	This paper revisits the classical edge-disjoint paths (EDP) problem, where one is given an undirected graph G and a set of terminal pairs P and asks whether G contains a set of pairwise edge-disjoint paths connecting every terminal pair in P. Our aim is to identify structural properties (parameters) of graphs which allow the efficient solution of EDP without restricting the placement of terminals in P in any way. In this setting, EDP is known to remain NP-hard even on extremely restricted graph classes, such as graphs with a vertex cover of size 3. We present three results which use edge-separator based parameters to chart new islands of tractability in the complexity landscape of EDP. Our first and main result utilizes the fairly recent structural parameter tree-cut width (a parameter with fundamental ties to graph immersions and graph cuts): we obtain a polynomial-time algorithm for EDP on every graph class of bounded tree-cut width. Our second result shows that EDP parameterized by tree-cut width is unlikely to be fixed-parameter tractable. Our final, third result is a polynomial kernel for EDP parameterized by the size of a minimum feedback edge set in the graph. This paper revisits the classical edge-disjoint paths (EDP) problem, where one is given an undirected graph and a set of terminal pairs and asks whether contains a set of pairwise edge-disjoint paths connecting every terminal pair in . Our aim is to identify structural properties (parameters) of graphs which allow the efficient solution of EDP without restricting the placement of terminals in in any way. In this setting, EDP is known to remain NP-hard even on extremely restricted graph classes, such as graphs with a vertex cover of size 3. We present three results which use edge-separator based parameters to chart new islands of tractability in the complexity landscape of EDP. Our first and main result utilizes the fairly recent structural parameter tree-cut width (a parameter with fundamental ties to graph immersions and graph cuts): we obtain a polynomial-time algorithm for EDP on every graph class of bounded tree-cut width. Our second result shows that EDP parameterized by tree-cut width is unlikely to be fixed-parameter tractable. Our final, third result is a polynomial kernel for EDP parameterized by the size of a minimum feedback edge set in the graph. This paper revisits the classical edge-disjoint paths (EDP) problem, where one is given an undirected graph G and a set of terminal pairs P and asks whether G contains a set of pairwise edge-disjoint paths connecting every terminal pair in P . Our aim is to identify structural properties (parameters) of graphs which allow the efficient solution of EDP without restricting the placement of terminals in P in any way. In this setting, EDP is known to remain NP-hard even on extremely restricted graph classes, such as graphs with a vertex cover of size 3. We present three results which use edge-separator based parameters to chart new islands of tractability in the complexity landscape of EDP. Our first and main result utilizes the fairly recent structural parameter tree-cut width (a parameter with fundamental ties to graph immersions and graph cuts): we obtain a polynomial-time algorithm for EDP on every graph class of bounded tree-cut width. Our second result shows that EDP parameterized by tree-cut width is unlikely to be fixed-parameter tractable. Our final, third result is a polynomial kernel for EDP parameterized by the size of a minimum feedback edge set in the graph. This paper revisits the classical edge-disjoint paths (EDP) problem, where one is given an undirected graph G and a set of terminal pairs P and asks whether G contains a set of pairwise edge-disjoint paths connecting every terminal pair in P. Our aim is to identify structural properties (parameters) of graphs which allow the efficient solution of EDP without restricting the placement of terminals in P in any way. In this setting, EDP is known to remain NP-hard even on extremely restricted graph classes, such as graphs with a vertex cover of size 3. We present three results which use edge-separator based parameters to chart new islands of tractability in the complexity landscape of EDP. Our first and main result utilizes the fairly recent structural parameter tree-cut width (a parameter with fundamental ties to graph immersions and graph cuts): we obtain a polynomial-time algorithm for EDP on every graph class of bounded tree-cut width. Our second result shows that EDP parameterized by tree-cut width is unlikely to be fixed-parameter tractable. Our final, third result is a polynomial kernel for EDP parameterized by the size of a minimum feedback edge set in the graph.This paper revisits the classical edge-disjoint paths (EDP) problem, where one is given an undirected graph G and a set of terminal pairs P and asks whether G contains a set of pairwise edge-disjoint paths connecting every terminal pair in P. Our aim is to identify structural properties (parameters) of graphs which allow the efficient solution of EDP without restricting the placement of terminals in P in any way. In this setting, EDP is known to remain NP-hard even on extremely restricted graph classes, such as graphs with a vertex cover of size 3. We present three results which use edge-separator based parameters to chart new islands of tractability in the complexity landscape of EDP. Our first and main result utilizes the fairly recent structural parameter tree-cut width (a parameter with fundamental ties to graph immersions and graph cuts): we obtain a polynomial-time algorithm for EDP on every graph class of bounded tree-cut width. Our second result shows that EDP parameterized by tree-cut width is unlikely to be fixed-parameter tractable. Our final, third result is a polynomial kernel for EDP parameterized by the size of a minimum feedback edge set in the graph.
Author	Ordyniak, Sebastian Ganian, Robert
Author_xml	– sequence: 1 givenname: Robert orcidid: 0000-0002-7762-8045 surname: Ganian fullname: Ganian, Robert email: rganian@gmail.com organization: Algorithms and Complexity Group, Vienna University of Technology – sequence: 2 givenname: Sebastian surname: Ordyniak fullname: Ordyniak, Sebastian organization: Algorithms Group, University of Sheffield
BackLink	https://www.ncbi.nlm.nih.gov/pubmed/33707803$$D View this record in MEDLINE/PubMed
BookMark	eNp9kUtv1DAUhS1URKeFP8ACRWLDxnD9SG6yQYJQHlIluihry8nYMx4l9mA7jPj3uEzLo4uurqz7naPje87IiQ_eEPKcwWsGgG8SgKwFBQ60PJHTwyOyYlJwCrVkJ2QFDFsqG4an5CylHQDj2DVPyKkQCNiCWJH-emuqq3AwsQq26pdM3-tk1tWVjno22cRU2RCrPsz7JTu_qS7WG0M_uLQLzueC5W16Sh5bPSXz7Haek28fL677z_Ty66cv_btLOkqUmYqOt8witlyirSXi0AGOuhZyQIa1bsbBokYYgK1Nw6yVLTam68YBxDByJs7J26Pvfhlmsx6Nz1FPah_drONPFbRT_2-826pN-KGwA4m1LAavbg1i-L6YlNXs0mimSXsTlqR4XS7UMFY3BX15D92FJfryPcVlJxhrRA2FevFvoj9R7u5bgPYIjDGkFI1Vo8s6u3AT0E2KgbqpUh2rVKVK9btKdShSfk965_6gSBxFqcB-Y-Lf2A-ofgFLXa-Z
CitedBy_id	crossref_primary_10_1137_20M137478X crossref_primary_10_1007_s00453_024_01241_4 crossref_primary_10_1007_s00453_020_00795_3 crossref_primary_10_1016_j_artint_2024_104241
Cites_doi	10.1007/s10107-002-0370-6 10.1007/BF02523685 10.1007/s004539910002 10.1137/130924056 10.1007/s002249910009 10.1007/978-3-642-14279-6 10.1016/S0166-218X(01)00223-2 10.1007/978-1-4471-5559-1 10.1016/S0095-8956(03)00067-4 10.1002/net.1975.5.1.45 10.1007/978-3-319-21275-3 10.1016/j.jctb.2014.07.003 10.1006/jctb.1995.1006 10.4086/toc.2006.v002a007 10.1007/978-3-662-48054-0_29 10.1007/978-3-319-28684-6_4 10.1145/2591796.2591876
ContentType	Journal Article
Copyright	The Author(s) 2020 The Author(s) 2020. The Author(s) 2020. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml	– notice: The Author(s) 2020 – notice: The Author(s) 2020. – notice: The Author(s) 2020. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID	C6C AAYXX CITATION NPM JQ2 7X8 5PM
DOI	10.1007/s00453-020-00772-w
DatabaseName	Springer Nature OA Free Journals CrossRef PubMed ProQuest Computer Science Collection MEDLINE - Academic PubMed Central (Full Participant titles)
DatabaseTitle	CrossRef PubMed ProQuest Computer Science Collection MEDLINE - Academic
DatabaseTitleList	PubMed CrossRef MEDLINE - Academic ProQuest Computer Science Collection
Database_xml	– sequence: 1 dbid: NPM name: PubMed url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 2 dbid: 7X8 name: MEDLINE - Academic url: https://search.proquest.com/medline sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science
EISSN	1432-0541
EndPage	752
ExternalDocumentID	PMC7904754 33707803 10_1007_s00453_020_00772_w
Genre	Journal Article
GrantInformation_xml	– fundername: FWF grantid: P31336 – fundername: Austrian Science Fund (FWF) – fundername: ; – fundername: ; grantid: P31336
GroupedDBID	-4Z -59 -5G -BR -EM -Y2 -~C -~X .86 .DC .VR 06D 0R~ 0VY 199 1N0 1SB 203 23M 28- 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 78A 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDPE ABDZT ABECU ABFSI ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABLJU ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTAH ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AI. AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. BA0 BBWZM BDATZ BGNMA BSONS C6C CAG COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP E.L EBLON EBS EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ H~9 I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV KOW LAS LLZTM M4Y MA- N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P9O PF- PT4 PT5 QOK QOS R4E R89 R9I RHV RIG RNI RNS ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TN5 TSG TSK TSV TUC U2A UG4 UOJIU UQL UTJUX UZXMN VC2 VFIZW VH1 VXZ W23 W48 WK8 YLTOR Z45 Z7X Z83 Z88 Z8R Z8W Z92 ZMTXR ZY4 ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION NPM JQ2 7X8 5PM
ID	FETCH-LOGICAL-c474t-39281f778247f5477b907ca534b7175a6cbf7a70b01de61ff4876e99cb03bc213
IEDL.DBID	RSV
ISICitedReferencesCount	16
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000580937400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0178-4617
IngestDate	Tue Nov 04 01:56:07 EST 2025 Wed Oct 01 13:33:25 EDT 2025 Sun Nov 09 07:45:25 EST 2025 Wed Feb 19 02:28:20 EST 2025 Sat Nov 29 02:20:29 EST 2025 Tue Nov 18 22:41:03 EST 2025 Fri Feb 21 02:49:37 EST 2025
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	2
Keywords	Edge-disjoint path problem Tree-cut width Feedback edge set Parameterized complexity
Language	English
License	The Author(s) 2020. Open AccessThis article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c474t-39281f778247f5477b907ca534b7175a6cbf7a70b01de61ff4876e99cb03bc213
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23
ORCID	0000-0002-7762-8045
OpenAccessLink	https://link.springer.com/10.1007/s00453-020-00772-w
PMID	33707803
PQID	2493116350
PQPubID	2043795
PageCount	27
ParticipantIDs	pubmedcentral_primary_oai_pubmedcentral_nih_gov_7904754 proquest_miscellaneous_2501261156 proquest_journals_2493116350 pubmed_primary_33707803 crossref_citationtrail_10_1007_s00453_020_00772_w crossref_primary_10_1007_s00453_020_00772_w springer_journals_10_1007_s00453_020_00772_w
PublicationCentury	2000
PublicationDate	2021-02-01
PublicationDateYYYYMMDD	2021-02-01
PublicationDate_xml	– month: 02 year: 2021 text: 2021-02-01 day: 01
PublicationDecade	2020
PublicationPlace	New York
PublicationPlace_xml	– name: New York – name: United States
PublicationTitle	Algorithmica
PublicationTitleAbbrev	Algorithmica
PublicationTitleAlternate	Algorithmica
PublicationYear	2021
Publisher	Springer US Springer Nature B.V
Publisher_xml	– name: Springer US – name: Springer Nature B.V
References	Karp (CR16) 1975; 5 CR18 CR17 Cygan, Fomin, Kowalik, Lokshtanov, Marx, Pilipczuk, Pilipczuk, Saurabh (CR4) 2015 Diestel (CR6) 2010 CR15 CR13 Nishizeki, Vygen, Zhou (CR21) 2001; 115 CR12 Garg, Vazirani, Yannakakis (CR14) 1997; 18 Chekuri, Khanna, Shepherd (CR2) 2006; 2 CR11 Robertson, Seymour (CR22) 1995; 63 Downey, Fellows (CR7) 2013 Cygan, Fomin, Kowalik, Lokshtanov, Marx, Pilipczuk, Pilipczuk, Saurabh (CR5) 2014 Zhou, Tamura, Nishizeki (CR26) 2000; 26 Marx, Wollan (CR20) 2014; 28 Courcelle, Makowsky, Rotics (CR3) 2000; 33 Kolliopoulos, Stein (CR19) 2004; 99 Berend, Tassa (CR1) 2010; 30 Robertson, Seymour (CR23) 2003; 89 Wollan (CR25) 2015; 110 CR8 CR9 CR24 Flum, Grohe (CR10) 2006 772_CR8 772_CR9 RG Downey (772_CR7) 2013 N Garg (772_CR14) 1997; 18 P Wollan (772_CR25) 2015; 110 SG Kolliopoulos (772_CR19) 2004; 99 J Flum (772_CR10) 2006 B Courcelle (772_CR3) 2000; 33 M Cygan (772_CR5) 2014 C Chekuri (772_CR2) 2006; 2 N Robertson (772_CR22) 1995; 63 772_CR11 772_CR12 772_CR13 D Marx (772_CR20) 2014; 28 N Robertson (772_CR23) 2003; 89 RM Karp (772_CR16) 1975; 5 X Zhou (772_CR26) 2000; 26 772_CR15 772_CR17 772_CR18 R Diestel (772_CR6) 2010 T Nishizeki (772_CR21) 2001; 115 D Berend (772_CR1) 2010; 30 M Cygan (772_CR4) 2015 772_CR24
References_xml	– volume: 99 start-page: 63 issue: 1 year: 2004 end-page: 87 ident: CR19 article-title: Approximating disjoint-path problems using packing integer programs publication-title: Math. Program. doi: 10.1007/s10107-002-0370-6 – ident: CR18 – year: 2014 ident: CR5 publication-title: Parameterized Algorithms – ident: CR12 – volume: 18 start-page: 3 issue: 1 year: 1997 end-page: 20 ident: CR14 article-title: Primal-dual approximation algorithms for integral flow and multicut in trees publication-title: Algorithmica doi: 10.1007/BF02523685 – volume: 26 start-page: 3 issue: 1 year: 2000 end-page: 30 ident: CR26 article-title: Finding edge-disjoint paths in partial k-trees publication-title: Algorithmica doi: 10.1007/s004539910002 – volume: 28 start-page: 503 issue: 1 year: 2014 end-page: 520 ident: CR20 article-title: Immersions in highly edge connected graphs publication-title: SIAM J. Discrete Math. doi: 10.1137/130924056 – volume: 33 start-page: 125 issue: 2 year: 2000 end-page: 150 ident: CR3 article-title: Linear time solvable optimization problems on graphs of bounded clique-width publication-title: Theory Comput. Syst. doi: 10.1007/s002249910009 – ident: CR8 – year: 2010 ident: CR6 publication-title: Graph Theory doi: 10.1007/978-3-642-14279-6 – year: 2006 ident: CR10 publication-title: Parameterized Complexity Theory. Texts in Theoretical Computer Science – volume: 115 start-page: 177 issue: 1–3 year: 2001 end-page: 186 ident: CR21 article-title: The edge-disjoint paths problem is NP-complete for series–parallel graphs publication-title: Discrete Appl. Math. doi: 10.1016/S0166-218X(01)00223-2 – year: 2013 ident: CR7 publication-title: Fundamentals of Parameterized Complexity. Texts in Computer Science doi: 10.1007/978-1-4471-5559-1 – volume: 89 start-page: 77 issue: 1 year: 2003 end-page: 108 ident: CR23 article-title: Graph minors. XVIII. tree-decompositions and well-quasi-ordering publication-title: J. Combin. Theory Ser. B doi: 10.1016/S0095-8956(03)00067-4 – volume: 30 start-page: 185 issue: 2 year: 2010 end-page: 205 ident: CR1 article-title: Improved bounds on bell numbers and on moments of sums of random variables publication-title: Probab. Math. Stat. – ident: CR15 – ident: CR17 – ident: CR13 – ident: CR11 – ident: CR9 – volume: 5 start-page: 45 issue: 1 year: 1975 end-page: 68 ident: CR16 article-title: On the computational complexity of combinatorial problems publication-title: Networks doi: 10.1002/net.1975.5.1.45 – year: 2015 ident: CR4 publication-title: Parameterized Algorithms doi: 10.1007/978-3-319-21275-3 – volume: 110 start-page: 47 year: 2015 end-page: 66 ident: CR25 article-title: The structure of graphs not admitting a fixed immersion publication-title: J. Combin. Theory Ser. B doi: 10.1016/j.jctb.2014.07.003 – volume: 63 start-page: 65 issue: 1 year: 1995 end-page: 110 ident: CR22 article-title: Graph minors XIII. The disjoint paths problem publication-title: J. Combin. Theory Ser. B doi: 10.1006/jctb.1995.1006 – volume: 2 start-page: 137 issue: 7 year: 2006 end-page: 146 ident: CR2 article-title: An O(sqrt(n)) approximation and integrality gap for disjoint paths and unsplittable flow publication-title: Theory Comput. doi: 10.4086/toc.2006.v002a007 – ident: CR24 – volume: 63 start-page: 65 issue: 1 year: 1995 ident: 772_CR22 publication-title: J. Combin. Theory Ser. B doi: 10.1006/jctb.1995.1006 – ident: 772_CR8 – volume: 115 start-page: 177 issue: 1–3 year: 2001 ident: 772_CR21 publication-title: Discrete Appl. Math. doi: 10.1016/S0166-218X(01)00223-2 – ident: 772_CR24 – volume-title: Parameterized Algorithms year: 2014 ident: 772_CR5 – volume-title: Parameterized Algorithms year: 2015 ident: 772_CR4 doi: 10.1007/978-3-319-21275-3 – volume-title: Fundamentals of Parameterized Complexity. Texts in Computer Science year: 2013 ident: 772_CR7 doi: 10.1007/978-1-4471-5559-1 – volume: 18 start-page: 3 issue: 1 year: 1997 ident: 772_CR14 publication-title: Algorithmica doi: 10.1007/BF02523685 – volume-title: Parameterized Complexity Theory. Texts in Theoretical Computer Science year: 2006 ident: 772_CR10 – volume: 110 start-page: 47 year: 2015 ident: 772_CR25 publication-title: J. Combin. Theory Ser. B doi: 10.1016/j.jctb.2014.07.003 – volume: 89 start-page: 77 issue: 1 year: 2003 ident: 772_CR23 publication-title: J. Combin. Theory Ser. B doi: 10.1016/S0095-8956(03)00067-4 – ident: 772_CR13 – volume: 33 start-page: 125 issue: 2 year: 2000 ident: 772_CR3 publication-title: Theory Comput. Syst. doi: 10.1007/s002249910009 – ident: 772_CR15 – volume: 30 start-page: 185 issue: 2 year: 2010 ident: 772_CR1 publication-title: Probab. Math. Stat. – ident: 772_CR11 doi: 10.1007/978-3-662-48054-0_29 – ident: 772_CR9 – volume: 28 start-page: 503 issue: 1 year: 2014 ident: 772_CR20 publication-title: SIAM J. Discrete Math. doi: 10.1137/130924056 – ident: 772_CR12 – volume: 2 start-page: 137 issue: 7 year: 2006 ident: 772_CR2 publication-title: Theory Comput. doi: 10.4086/toc.2006.v002a007 – volume: 5 start-page: 45 issue: 1 year: 1975 ident: 772_CR16 publication-title: Networks doi: 10.1002/net.1975.5.1.45 – ident: 772_CR18 doi: 10.1007/978-3-319-28684-6_4 – volume-title: Graph Theory year: 2010 ident: 772_CR6 doi: 10.1007/978-3-642-14279-6 – ident: 772_CR17 doi: 10.1145/2591796.2591876 – volume: 26 start-page: 3 issue: 1 year: 2000 ident: 772_CR26 publication-title: Algorithmica doi: 10.1007/s004539910002 – volume: 99 start-page: 63 issue: 1 year: 2004 ident: 772_CR19 publication-title: Math. Program. doi: 10.1007/s10107-002-0370-6
SSID	ssj0012796
Score	2.4311163
Snippet	This paper revisits the classical edge-disjoint paths (EDP) problem, where one is given an undirected graph G and a set of terminal pairs P and asks whether G... This paper revisits the classical edge-disjoint paths (EDP) problem, where one is given an undirected graph and a set of terminal pairs and asks whether... This paper revisits the classical edge-disjoint paths (EDP) problem, where one is given an undirected graph G and a set of terminal pairs P and asks whether G...
SourceID	pubmedcentral proquest pubmed crossref springer
SourceType	Open Access Repository Aggregation Database Index Database Enrichment Source Publisher
StartPage	726
SubjectTerms	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Cut width Data Structures and Information Theory Graphs Mathematics of Computing Parameter identification Parameterization Polynomials Separators Theory of Computation
Title	The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths
URI	https://link.springer.com/article/10.1007/s00453-020-00772-w https://www.ncbi.nlm.nih.gov/pubmed/33707803 https://www.proquest.com/docview/2493116350 https://www.proquest.com/docview/2501261156 https://pubmed.ncbi.nlm.nih.gov/PMC7904754
Volume	83
WOSCitedRecordID	wos000580937400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVAVX databaseName: Springer LINK customDbUrl: eissn: 1432-0541 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0012796 issn: 0178-4617 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dT9swED9R2MNeBvti2QB5Em_MUhM7dvK4FSoeJlRtUPUtcvwxOk0pIun493d2k6BShrQ9-2zH57vcz77zHcCxzVmuHCogmgNNueGGKlMKap3ULkZ7acJ9x_SrvLjIZrN80j4Kq7to984lGf7U_WM3jz68z9G_hEZMSO8GsIPmLvMFG759n_a-g0SGqly-7jzlaKDbpzKPj7FujjYw5mao5AN_aTBD493_W8AevGhhJ_m8kpOXsGWrV7DblXQgrYa_hhGKDZn4ymlk4cho2dAvaOYMmSgfxOUzcRJEuWTVEScnZ-aHpafz-udiXjVI1lzXb-BqfHY5OqdtnQWqueQNRYiUxU4iVuDSpVzKEk_MWqWMl3jYS5XQpZNK-itTY0XsHB5yhM1zXQ5ZqZOYvYXtalHZd0AShYBRJDrnPOXClD4XDVPKMCFw9CyPIO7YXeg2CbmvhfGr6NMnBy4VyKUicKm4i-Ck73OzSsHxJPVBt4tFq451gWdMFiPyTIcRfOybUZG8d0RVdrFEmhRFRyBAFhHsrza9n44xnxRpyCKQa-LQE_gk3est1fw6JOuW-ZDLlEfwqROK-8_6-yre_xv5B3ie-FibEE1-ANvN7dIewjP9u5nXt0cwkLPsKCjJH7glCUE
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3db9MwED_BmDReVtgHhA0w0t42S03s2M0jlE1DlKpiY9pb5PhjK0IpWtL13-fsJpnKYBI8-_Lhy13uZ9_5dwAHNmOZcuiAGA405YYbqkwhqHVSuxjjpQn7HRcjOR4PLi-zSXMorGqr3duUZPhTd4fdPPrwOUd_EhoxIV08hiccI5ZnzP96dtHlDhIZunL5vvOUY4Bujsr8-R6r4egexrxfKvlbvjSEoZPe_03gGWw2sJO8X9rJc3hkyy3otS0dSOPh2zBEsyET3zmNzBwZzmv6AcOcIRPli7g8EydBlEuWF-LDybG5svTjtPo-m5Y1itXX1Q58Ozk-H57Sps8C1VzymiJEGsROIlbg0qVcygJXzFqljBe42EuV0IWTSvotU2NF7BwucoTNMl30WaGTmO3CWjkr7UsgiULAKBKdcZ5yYQrPRcOUMkwIvPsgiyBu1Z3rhoTc98L4kXf0yUFLOWopD1rKFxEcdtf8XFJwPCi9337FvHHHKsc1JosReab9CN51w-hIPjuiSjubo0yKpiMQIIsIXiw_evc4xjwpUp9FIFfMoRPwJN2rI-X0OpB1y6zPZcojOGqN4u61_j6LV_8m_hY2Ts-_jPLRp_HnPXia-LqbUFm-D2v1zdy-hnV9W0-rmzfBVX4B7oELPQ
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3db9QwDLdgILQXxvcKA4LEG0S7NmlyfYTbTiCm00nAtLcqzcd2CPWmXY_9-9jpBxwDJMRz3TZNbfnn2P4Z4KUvRGECGiC6A8ulk44bVynug7YhRX_p4nnH8ZGezcYnJ8X8py7-WO3epyTbngZiaaqb_XMX9ofGN0IilH-krmjEh_zyOtyQVEhP8frH4yGPkOk4oYtm0HOJzrprm_n9MzZd0xW8ebVs8pfcaXRJ053__5g7cLuDo-xNqz934Zqv78FOP-qBdZZ_HyaoTmxOE9XYMrDJuuFv0f05NjdU3EUMnQzRL2tvxIWwQ3fq-cFi9WW5qBsUa85WD-Dz9PDT5B3v5i9wK7VsOEKncRo0YgipQy61rjCStiYXssIgMDfKVkEbTUepzqs0BAx-lC8KW41EZbNUPISteln7XWCZQSCpMltImUvlKuKoEcY4oRQ-fVwkkPZbX9qOnJxmZHwtB1rluEsl7lIZd6m8TODVcM95S83xV-m9_o-WnZmuSow9RYqINB8l8GK4jAZGWRNT--UaZXJUI4XAWSXwqFWA4XVCEFnSSCSgN1RjECDy7s0r9eIsknjrYiR1LhN43SvIj2X9-Sse_5v4c7g1P5iWR-9nH57AdkblOLHgfA-2mou1fwo37bdmsbp4Fq3mO---FCE
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=The+Power+of+Cut-Based+Parameters+for+Computing+Edge-Disjoint+Paths&rft.jtitle=Algorithmica&rft.au=Ganian%2C+Robert&rft.au=Ordyniak%2C+Sebastian&rft.date=2021-02-01&rft.pub=Springer+US&rft.issn=0178-4617&rft.eissn=1432-0541&rft.volume=83&rft.issue=2&rft.spage=726&rft.epage=752&rft_id=info:doi/10.1007%2Fs00453-020-00772-w&rft_id=info%3Apmid%2F33707803&rft.externalDocID=PMC7904754
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0178-4617&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0178-4617&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0178-4617&client=summon