Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset
Given a directed graph $G$, a set of $k$ terminals, and an integer $p$, the Directed Vertex Multiway Cut problem asks whether there is a set $S$ of at most $p$ (nonterminal) vertices whose removal disconnects each terminal from all other terminals. Directed Edge Multiway Cut is the analogous problem...
Uložené v:
| Vydané v: | SIAM journal on computing Ročník 42; číslo 4; s. 1674 - 1696 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Philadelphia
Society for Industrial and Applied Mathematics
01.01.2013
|
| Predmet: | |
| ISSN: | 0097-5397, 1095-7111 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Given a directed graph $G$, a set of $k$ terminals, and an integer $p$, the Directed Vertex Multiway Cut problem asks whether there is a set $S$ of at most $p$ (nonterminal) vertices whose removal disconnects each terminal from all other terminals. Directed Edge Multiway Cut is the analogous problem where $S$ is a set of at most $p$ edges. These two problems are indeed known to be equivalent. A natural generalization of the multiway cut is the Multicut problem, in which we want to disconnect only a set of $k$ given pairs instead of all pairs. Marx [Theoret. Comput. Sci., 351 (2006), pp. 394--406] showed that in undirected graphs Vertex/Edge Multiway cut is fixed-parameter tractable (FPT) parameterized by $p$. Marx and Razgon [Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011, pp. 469--478] showed that undirected Multicut is FPT and Directed Multicut is W[1]-hard parameterized by $p$. We complete the picture here by our main result, which is that both Directed Vertex Multiway Cut and Directed Edge Multiway Cut can be solved in time $2^{2^{O(p)}}n^{O(1)}$, i.e., FPT parameterized by size $p$ of the cutset of the solution. This answers an open question raised by the aforementioned papers. It follows from our result that Directed Edge/Vertex Multicut is FPT for the case of $k=2$ terminal pairs, which answers another open problem raised by Marx and Razgon. [PUBLICATION ABSTRACT] |
|---|---|
| AbstractList | Given a directed graph $G$, a set of $k$ terminals, and an integer $p$, the Directed Vertex Multiway Cut problem asks whether there is a set $S$ of at most $p$ (nonterminal) vertices whose removal disconnects each terminal from all other terminals. Directed Edge Multiway Cut is the analogous problem where $S$ is a set of at most $p$ edges. These two problems are indeed known to be equivalent. A natural generalization of the multiway cut is the Multicut problem, in which we want to disconnect only a set of $k$ given pairs instead of all pairs. Marx [Theoret. Comput. Sci., 351 (2006), pp. 394--406] showed that in undirected graphs Vertex/Edge Multiway cut is fixed-parameter tractable (FPT) parameterized by $p$. Marx and Razgon [Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011, pp. 469--478] showed that undirected Multicut is FPT and Directed Multicut is W[1]-hard parameterized by $p$. We complete the picture here by our main result, which is that both Directed Vertex Multiway Cut and Directed Edge Multiway Cut can be solved in time $2^{2^{O(p)}}n^{O(1)}$, i.e., FPT parameterized by size $p$ of the cutset of the solution. This answers an open question raised by the aforementioned papers. It follows from our result that Directed Edge/Vertex Multicut is FPT for the case of $k=2$ terminal pairs, which answers another open problem raised by Marx and Razgon. [PUBLICATION ABSTRACT] Given a directed graph $G$, a set of $k$ terminals, and an integer $p$, the Directed Vertex Multiway Cut problem asks whether there is a set $S$ of at most $p$ (nonterminal) vertices whose removal disconnects each terminal from all other terminals. Directed Edge Multiway Cut is the analogous problem where $S$ is a set of at most $p$ edges. These two problems are indeed known to be equivalent. A natural generalization of the multiway cut is the Multicut problem, in which we want to disconnect only a set of $k$ given pairs instead of all pairs. Marx [Theoret. Comput. Sci. , 351 (2006), pp. 394--406] showed that in undirected graphs Vertex/Edge Multiway cut is fixed-parameter tractable (FPT) parameterized by $p$. Marx and Razgon [Proceedings of the 43rd ACM Symposium on Theory of Computing , 2011, pp. 469--478] showed that undirected Multicut is FPT and Directed Multicut is W[1]-hard parameterized by $p$. We complete the picture here by our main result, which is that both Directed Vertex Multiway Cut and Directed Edge Multiway Cut can be solved in time $22O(p)}}nO(1)}$, i.e., FPT parameterized by size $p$ of the cutset of the solution. This answers an open question raised by the aforementioned papers. It follows from our result that Directed Edge/Vertex Multicut is FPT for the case of $k=2$ terminal pairs, which answers another open problem raised by Marx and Razgon. |
| Author | Marx, Dániel Hajiaghayi, MohammadTaghi Chitnis, Rajesh |
| Author_xml | – sequence: 1 givenname: Rajesh surname: Chitnis fullname: Chitnis, Rajesh – sequence: 2 givenname: MohammadTaghi surname: Hajiaghayi fullname: Hajiaghayi, MohammadTaghi – sequence: 3 givenname: Dániel surname: Marx fullname: Marx, Dániel |
| BookMark | eNptkE9Lw0AQxRepYFs9-A0CXvQQu7NJs8lRqlVBUbCCFwn7Z4Jb0qTubtD46d1S6aF4mhne7w0zb0QGTdsgIadALwESPgFG84wBfzsgQ6DFNOYAMCBDSgseT5OCH5GRc0tKIU0hGZL3uflGHT8LK1bo0UYLK5QX0tTG91FbRdfGovKoo8eu9uZL9NGs89GONz9Bkn3kPzB6CcPGsukD5NAfk8NK1A5P_uqYvM5vFrO7-OHp9n529RArVlAfF1KCyCRwmWqpK8aUAlbJNClEJYKAXGOioJBZrlHmKuWF0gwRs2l4lulkTM63e9e2_ezQ-XJlnMK6Fg22nSthmnHK8zyjAT3bQ5dtZ5twXQkp5AwoZEmgLraUsq1zFqtybc1K2L4EWm6CLndBB3ayxyrjhTdt460w9T-OX5lKgaY |
| CitedBy_id | crossref_primary_10_1016_j_jcss_2017_01_003 crossref_primary_10_1007_s00453_019_00609_1 crossref_primary_10_1145_2700209 crossref_primary_10_1145_3201775 crossref_primary_10_1137_21M1398203 crossref_primary_10_1016_j_ipl_2013_09_004 crossref_primary_10_1145_3379698 crossref_primary_10_1137_120904202 crossref_primary_10_1137_140961808 crossref_primary_10_1137_110855247 crossref_primary_10_1016_j_disopt_2022_100740 crossref_primary_10_1137_22M153118X crossref_primary_10_1016_j_tcs_2021_10_023 crossref_primary_10_1016_j_cosrev_2023_100556 crossref_primary_10_1145_2594439 crossref_primary_10_1007_s00453_016_0139_6 crossref_primary_10_1137_23M1548591 crossref_primary_10_1137_15M1041213 crossref_primary_10_1145_3706103 crossref_primary_10_1007_s00453_023_01196_y crossref_primary_10_1137_15M1032077 crossref_primary_10_1016_j_ic_2015_11_002 crossref_primary_10_1137_18M1176087 crossref_primary_10_1016_j_tcs_2023_114174 crossref_primary_10_1145_3426738 |
| Cites_doi | 10.1016/S0196-6774(03)00111-1 10.1016/j.ic.2012.10.016 10.1016/j.tcs.2005.10.007 10.1006/jctb.1995.1006 10.1287/moor.1030.0086 10.1007/s00224-009-9215-5 10.1016/j.jctb.2004.08.001 10.1016/j.disopt.2010.05.003 10.1137/1.9781611973099.136 10.4153/CJM-1956-045-5 10.1145/2462896.2462899 10.1137/S0097539792225297 10.1007/s00453-007-9130-6 |
| ContentType | Journal Article |
| Copyright | 2013, Society for Industrial and Applied Mathematics |
| Copyright_xml | – notice: 2013, Society for Industrial and Applied Mathematics |
| DBID | AAYXX CITATION 3V. 7RQ 7WY 7WZ 7X2 7XB 87Z 88A 88F 88I 88K 8AL 8FE 8FG 8FH 8FK 8FL 8G5 ABJCF ABUWG AFKRA ARAPS ATCPS AZQEC BBNVY BENPR BEZIV BGLVJ BHPHI CCPQU D1I DWQXO FRNLG F~G GNUQQ GUQSH HCIFZ JQ2 K60 K6~ K7- KB. L.- L6V LK8 M0C M0K M0N M1Q M2O M2P M2T M7P M7S MBDVC P5Z P62 PATMY PDBOC PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PRINS PTHSS PYCSY Q9U S0W U9A 7SC 8FD L7M L~C L~D |
| DOI | 10.1137/12086217X |
| DatabaseName | CrossRef ProQuest Central (Corporate) Career & Technical Education Database ABI/INFORM Collection ABI/INFORM Global (PDF only) Agricultural Science Collection ProQuest Central (purchase pre-March 2016) ABI/INFORM Global (Alumni Edition) Biology Database (Alumni Edition) Military Database (Alumni Edition) Science Database (Alumni Edition) Telecommunications (Alumni Edition) Computing Database (Alumni Edition) ProQuest SciTech Collection ProQuest Technology Collection ProQuest Natural Science Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni Edition) Research Library (Alumni Edition) Materials Science & Engineering Collection ProQuest Central (Alumni Edition) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection Agricultural & Environmental Science Collection ProQuest Central Essentials Biological Science Collection ProQuest Central Business Premium Collection Technology Collection Natural Science Collection ProQuest One Community College ProQuest Materials Science Collection ProQuest Central Korea Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student Research Library Prep SciTech Premium Collection ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database Materials Science Database ABI/INFORM Professional Advanced ProQuest Engineering Collection ProQuest Biological Science Collection ABI/INFORM Global Agricultural Science Database Computing Database Military Database Research Library Science Database Telecommunications Database Biological Science Database Engineering Database Research Library (Corporate) Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection Environmental Science Database Materials Science Collection ProQuest Central Premium ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection Environmental Science Collection ProQuest Central Basic DELNET Engineering & Technology Collection Computer and Information Systems Abstracts Technology Research Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Agricultural Science Database ProQuest Business Collection (Alumni Edition) Research Library Prep Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection SciTech Premium Collection ProQuest Military Collection ProQuest Central China ABI/INFORM Complete ProQuest Telecommunications ProQuest One Applied & Life Sciences Natural Science Collection Biological Science Collection ProQuest Central (New) Engineering Collection Career and Technical Education (Alumni Edition) Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global Engineering Database ProQuest Science Journals (Alumni Edition) ProQuest Biological Science Collection ProQuest One Academic Eastern Edition Agricultural Science Collection ProQuest Technology Collection ProQuest Telecommunications (Alumni Edition) Biological Science Database ProQuest Business Collection Environmental Science Collection ProQuest Career and Technical Education ProQuest One Academic UKI Edition Environmental Science Database ProQuest One Academic ProQuest One Academic (New) ABI/INFORM Global (Corporate) ProQuest One Business Technology Collection ProQuest One Academic Middle East (New) Materials Science Collection ProQuest Central (Alumni Edition) ProQuest One Community College Research Library (Alumni Edition) ProQuest Natural Science Collection ProQuest Biology Journals (Alumni Edition) ProQuest Central ABI/INFORM Professional Advanced ProQuest Engineering Collection ProQuest Central Korea Agricultural & Environmental Science Collection Materials Science Database ProQuest Research Library ABI/INFORM Complete (Alumni Edition) ProQuest Materials Science Collection ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Science Journals ProQuest Computing (Alumni Edition) ProQuest Military Collection (Alumni Edition) ProQuest SciTech Collection Advanced Technologies & Aerospace Database ProQuest DELNET Engineering and Technology Collection Materials Science & Engineering Collection ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni) Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Agricultural Science Database Computer and Information Systems Abstracts |
| Database_xml | – sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1095-7111 |
| EndPage | 1696 |
| ExternalDocumentID | 3038195021 10_1137_12086217X |
| GroupedDBID | --Z -DZ -~X .4S .DC 123 4.4 7RQ 7WY 7X2 7XC 88I 8CJ 8FE 8FG 8FH 8FL 8G5 8V8 AALVN AASXH AAYXX ABDBF ABDPE ABJCF ABKAD ABMZU ABPPZ ABUFD ABUWG ACBEA ACGFO ACGOD ACIWK ACNCT ACPRK ACUHS ADBBV ADMHC ADXHL AEMOZ AENEX AFFHD AFKRA AFRAH AHQJS AKVCP ALMA_UNASSIGNED_HOLDINGS ANXRF ARAPS ARCSS ATCPS AZQEC BBNVY BENPR BEZIV BGLVJ BHPHI BPHCQ CCPQU CITATION CS3 CZ9 D1I D1J D1K DQ2 DU5 DWQXO EAP EAS EBR EBS EBU ECS EDO EJD EMK EST ESX FRNLG GNUQQ GUQSH H13 HCIFZ H~9 I-F K1G K6- K60 K6V K6~ K7- KB. KC. L6V LK5 LK8 M0C M0K M1Q M2O M2P M7P M7R M7S MK~ NHB OHT P1Q P2P P62 PATMY PDBOC PHGZM PHGZT PQBIZ PQBZA PQGLB PQQKQ PROAC PTHSS PYCSY RJG RNS RSI S0W TAE TH9 TN5 TUS TWZ UHB UQL VOH WH7 WHG XJE YNT YYP YZZ ZCG ZY4 3V. 7XB 88A 88K 8AL 8FK JQ2 L.- M0N M2T MBDVC PKEHL PQEST PQUKI PRINS Q9U U9A 7SC 8FD L7M L~C L~D PUEGO |
| ID | FETCH-LOGICAL-c290t-9bb1a6b17b4dbdf22cc12fb439afaa6be7de3c19b68deb8c479cd2eee658622d3 |
| IEDL.DBID | M7P |
| ISICitedReferencesCount | 39 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000323889100010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0097-5397 |
| IngestDate | Fri Sep 05 12:53:01 EDT 2025 Fri Jul 25 10:29:01 EDT 2025 Sat Nov 29 03:54:35 EST 2025 Tue Nov 18 21:26:12 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 4 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c290t-9bb1a6b17b4dbdf22cc12fb439afaa6be7de3c19b68deb8c479cd2eee658622d3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 ObjectType-Article-2 ObjectType-Feature-1 content type line 23 |
| PQID | 1418210163 |
| PQPubID | 666313 |
| PageCount | 23 |
| ParticipantIDs | proquest_miscellaneous_1567078860 proquest_journals_1418210163 crossref_primary_10_1137_12086217X crossref_citationtrail_10_1137_12086217X |
| PublicationCentury | 2000 |
| PublicationDate | 2013-01-01 |
| PublicationDateYYYYMMDD | 2013-01-01 |
| PublicationDate_xml | – month: 01 year: 2013 text: 2013-01-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | Philadelphia |
| PublicationPlace_xml | – name: Philadelphia |
| PublicationTitle | SIAM journal on computing |
| PublicationYear | 2013 |
| Publisher | Society for Industrial and Applied Mathematics |
| Publisher_xml | – name: Society for Industrial and Applied Mathematics |
| References | atypb8 Chitnis R. H. (atypb4) 2012 Chen J. (atypb3) 2008; 55 Kratsch S. (atypb16) 2012 Razgon I. (atypb23) 2009; 75 atypb15 atypb26 Cygan M. (atypb6) 2012 atypb17 atypb18 atypb11 Naor M. (atypb21) 1995 atypb13 atypb24 atypb14 atypb25 Naor J. (atypb20) 1997 atypb2 atypb5 atypb7 |
| References_xml | – ident: atypb13 doi: 10.1016/S0196-6774(03)00111-1 – ident: atypb17 doi: 10.1016/j.ic.2012.10.016 – start-page: 230 year: 2012 ident: atypb4 publication-title: Heidelberg – ident: atypb18 doi: 10.1016/j.tcs.2005.10.007 – ident: atypb24 doi: 10.1006/jctb.1995.1006 – start-page: 254 year: 2012 ident: atypb6 publication-title: Heidelberg – ident: atypb15 doi: 10.1287/moor.1030.0086 – start-page: 548 year: 1997 ident: atypb20 publication-title: Washington, DC – ident: atypb26 doi: 10.1007/s00224-009-9215-5 – volume: 75 start-page: 435 year: 2009 ident: atypb23 publication-title: Almost 2-SAT is fixed-parameter tractable, J. Comput. Syst. Sci. – ident: atypb25 doi: 10.1016/j.jctb.2004.08.001 – start-page: 182 year: 1995 ident: atypb21 publication-title: Washington, DC – volume: 55 start-page: 21 year: 2008 ident: atypb3 publication-title: J. ACM – ident: atypb14 doi: 10.1016/j.disopt.2010.05.003 – ident: atypb5 doi: 10.1137/1.9781611973099.136 – ident: atypb11 doi: 10.4153/CJM-1956-045-5 – start-page: 581 year: 2012 ident: atypb16 publication-title: Heidelberg – ident: atypb7 doi: 10.1145/2462896.2462899 – ident: atypb8 doi: 10.1137/S0097539792225297 – ident: atypb2 doi: 10.1007/s00453-007-9130-6 |
| SSID | ssj0014413 |
| Score | 2.3256788 |
| Snippet | Given a directed graph $G$, a set of $k$ terminals, and an integer $p$, the Directed Vertex Multiway Cut problem asks whether there is a set $S$ of at most $p$... |
| SourceID | proquest crossref |
| SourceType | Aggregation Database Enrichment Source Index Database |
| StartPage | 1674 |
| SubjectTerms | Algorithms Approximation Computation Disengaging Equivalence Graph theory Graphs Integers Mathematical models Terminals |
| Title | Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset |
| URI | https://www.proquest.com/docview/1418210163 https://www.proquest.com/docview/1567078860 |
| Volume | 42 |
| WOSCitedRecordID | wos000323889100010&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: PRVPQU databaseName: ABI/INFORM Collection customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: 7WY dateStart: 19720301 isFulltext: true titleUrlDefault: https://www.proquest.com/abicomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ABI/INFORM Global customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: M0C dateStart: 19720301 isFulltext: true titleUrlDefault: https://search.proquest.com/abiglobal providerName: ProQuest – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: P5Z dateStart: 19720301 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Agricultural Science Database customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: M0K dateStart: 19720301 isFulltext: true titleUrlDefault: https://search.proquest.com/agriculturejournals providerName: ProQuest – providerCode: PRVPQU databaseName: Biological Science Database customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: M7P dateStart: 19720301 isFulltext: true titleUrlDefault: http://search.proquest.com/biologicalscijournals providerName: ProQuest – providerCode: PRVPQU databaseName: Career & Technical Education Database (ProQuest) customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: 7RQ dateStart: 19720301 isFulltext: true titleUrlDefault: https://search.proquest.com/career providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: K7- dateStart: 19720301 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: M7S dateStart: 19720301 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: Environmental Science Database customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: PATMY dateStart: 19720301 isFulltext: true titleUrlDefault: http://search.proquest.com/environmentalscience providerName: ProQuest – providerCode: PRVPQU databaseName: Materials Science Database customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: KB. dateStart: 19720301 isFulltext: true titleUrlDefault: http://search.proquest.com/materialsscijournals providerName: ProQuest – providerCode: PRVPQU databaseName: Military Database customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: M1Q dateStart: 19720301 isFulltext: true titleUrlDefault: https://search.proquest.com/military providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: BENPR dateStart: 19720301 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Research Library customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: M2O dateStart: 19720301 isFulltext: true titleUrlDefault: https://search.proquest.com/pqrl providerName: ProQuest – providerCode: PRVPQU databaseName: Science Database (ProQuest) customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: M2P dateStart: 19720301 isFulltext: true titleUrlDefault: https://search.proquest.com/sciencejournals providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3db9MwED-xjQd4YDBAdIzKIB54MaudDydPiFWrkKaWsBVRkFAUf0SqhNptSYHy13PnukGTEC-8_BTLFyvK2Xfnr98BvEwipROXWB7rWvLYRBXP0e9zVad5Jo3ReVb7ZBNqMslms7wIC25NOFa5tYneUNuloTXyYxFjJExTzejN5RWnrFG0uxpSaOzAHrEkRP7oXtHtIqCrDyyUiifoeAOzkIjUsZAUyws1u-mPbppj72NG-__7dffhXogu2dtNd3gAt9ziAPa3mRtYGMgHcHfcsbU2D-HraP7TWV5UdFCL5KZ0dWpD4L1my5pt7KKzzF_X_VGt2XDVsk5-_gur9Jphk-wCC_QKPaNQ49pH8HF0Oh2-4yHtAjcyH7Q811pUqRZKx1bbWqLGhKw1Ri5VXWGFU9ZFRuQ6zazTmYlVbqx0zmEwk0ppo8ewu1gu3BNgGH4kta4qg3YiThRx66e0EYd9IrFZrXvwavvzSxM4ySk1xrfSz00iVXZ66sGLTvRyQ8TxN6GjrXrKMBab8o9uevC8q8ZRRFsj1cItVyiTpER7lKWDw3838RTuSJ8QgxZhjmC3vV65Z3DbfG_nzXUfdtT5B8JPn_uwd3I6Kc6xdKY44clrxPFg6PGMUJDsWL73WHic9n0X9niBWCRffgNZpfBV |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LSxxBEC6MCSQ5qDEJ2ahJGxLIpdHpefTMQURMFkV3EbKBvYSxn7AQdo0zG7P-KH-jVfMSIeTmIbcZuqaZxzdfdXV11wfwMQ6ljl1seaS94JEJFc_Q73PpkywVxugs9ZXYhBwO0_E4O1uCm3YvDC2rbDmxImo7MzRHvhNEOBKmUDPcv_jFSTWKsquthEYNixO3uMKQrdg7_oLf95MQ_a-jwyPeqApwI7LdkmdaByrRgdSR1dYLvKFAeI2OWXmFDU5aF5og00lqnU5NJDNjhXMOfXUihA2x30fwOMJIiP6ogRh1WQscWjRVLyWP0dE3lYyCUO4EgmKHQI7v-7_79F_5tP7q__Y21mClGT2zgxruL2DJTddhtVWmYA1RrcPzQVeNtngJP_qTP87yM0UL0chuRFvD6gLlCzbzrOZ9Z1m1HflKLdjhvGSd_eQam_SCYZfsG57QJXSMRoUrX8H3B3nk17A8nU3dG2A4vIq9VsogD0axJO2AhBKNiPnYpl734HP7sXPT1Fwn6Y-feRV7hTLvcNGDD53pRV1o5G9Gmy0c8oZrivwOCz3Y7pqRJSj1o6ZuNkebOKGyTmmy-_bfXbyHp0ejwWl-ejw82YBnohL_oAmnTVguL-duC56Y3-WkuHxXQZ_B-UOj6xYsdUU9 |
| 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=Fixed-Parameter+Tractability+of+Directed+Multiway+Cut+Parameterized+by+the+Size+of+the+Cutset&rft.jtitle=SIAM+journal+on+computing&rft.au=Chitnis%2C+Rajesh&rft.au=Hajiaghayi%2C+MohammadTaghi&rft.au=Marx%2C+Daniel&rft.date=2013-01-01&rft.issn=0097-5397&rft.eissn=1095-7111&rft.volume=42&rft.issue=4&rft.spage=1674&rft.epage=1696&rft_id=info:doi/10.1137%2F12086217X&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0097-5397&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0097-5397&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0097-5397&client=summon |