An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion

A cactus is a connected graph that does not contain K 4 − e as a minor. Given a graph G = ( V , E ) and an integer k ≥ 0, Cactus Vertex Deletion (also known as Diamond Hitting Set ) is the problem of deciding whether G has a vertex set of size at most k whose removal leaves a forest of cacti. The pr...

Full description

Saved in:

Bibliographic Details
Published in:	Theory of computing systems Vol. 66; no. 2; pp. 502 - 515
Main Authors:	Aoike, Yuuki, Gima, Tatsuya, Hanaka, Tesshu, Kiyomi, Masashi, Kobayashi, Yasuaki, Kobayashi, Yusuke, Kurita, Kazuhiro, Otachi, Yota
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.04.2022 Springer Nature B.V
Subjects:	Algorithms Apexes Cacti Computer Science Deletion Diamonds Parameterization Theory of Computation Vertex sets Fixed-parameter tractable Measure and conquer analysis Cactus vertex deletion Even cycle transversal
ISSN:	1432-4350, 1433-0490
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	A cactus is a connected graph that does not contain K 4 − e as a minor. Given a graph G = ( V , E ) and an integer k ≥ 0, Cactus Vertex Deletion (also known as Diamond Hitting Set ) is the problem of deciding whether G has a vertex set of size at most k whose removal leaves a forest of cacti. The previously best deterministic parameterized algorithm for this problem was due to Bonnet et al. [WG 2016 ], which runs in time 26 k n O (1) , where n is the number of vertices of G . In this paper, we design a deterministic algorithm for Cactus Vertex Deletion , which runs in time 17.64 k n O (1) . As an almost straightforward application of our algorithm, we also give a deterministic 17.64 k n O (1) -time algorithm for Even Cycle Transversal , which improves the previous running time 50 k n O (1) of the known deterministic parameterized algorithm due to Misra et al. [WG 2012 ].
AbstractList	A cactus is a connected graph that does not contain K4 − e as a minor. Given a graph G = (V,E) and an integer k ≥ 0, Cactus Vertex Deletion (also known as Diamond Hitting Set) is the problem of deciding whether G has a vertex set of size at most k whose removal leaves a forest of cacti. The previously best deterministic parameterized algorithm for this problem was due to Bonnet et al. [WG 2016], which runs in time 26knO(1), where n is the number of vertices of G. In this paper, we design a deterministic algorithm for Cactus Vertex Deletion, which runs in time 17.64knO(1). As an almost straightforward application of our algorithm, we also give a deterministic 17.64knO(1)-time algorithm for Even Cycle Transversal, which improves the previous running time 50knO(1) of the known deterministic parameterized algorithm due to Misra et al. [WG 2012]. A cactus is a connected graph that does not contain K 4 − e as a minor. Given a graph G = ( V , E ) and an integer k ≥ 0, Cactus Vertex Deletion (also known as Diamond Hitting Set ) is the problem of deciding whether G has a vertex set of size at most k whose removal leaves a forest of cacti. The previously best deterministic parameterized algorithm for this problem was due to Bonnet et al. [WG 2016 ], which runs in time 26 k n O (1) , where n is the number of vertices of G . In this paper, we design a deterministic algorithm for Cactus Vertex Deletion , which runs in time 17.64 k n O (1) . As an almost straightforward application of our algorithm, we also give a deterministic 17.64 k n O (1) -time algorithm for Even Cycle Transversal , which improves the previous running time 50 k n O (1) of the known deterministic parameterized algorithm due to Misra et al. [WG 2012 ].
Author	Aoike, Yuuki Otachi, Yota Kobayashi, Yasuaki Kiyomi, Masashi Kobayashi, Yusuke Gima, Tatsuya Hanaka, Tesshu Kurita, Kazuhiro
Author_xml	– sequence: 1 givenname: Yuuki surname: Aoike fullname: Aoike, Yuuki organization: School of Data Science, Yokohama City University – sequence: 2 givenname: Tatsuya surname: Gima fullname: Gima, Tatsuya organization: Graduate School of Informatics, Nagoya University – sequence: 3 givenname: Tesshu surname: Hanaka fullname: Hanaka, Tesshu organization: Graduate School of Informatics, Nagoya University – sequence: 4 givenname: Masashi surname: Kiyomi fullname: Kiyomi, Masashi organization: Faculty of Science and Technology, Seikei University – sequence: 5 givenname: Yasuaki orcidid: 0000-0003-3244-6915 surname: Kobayashi fullname: Kobayashi, Yasuaki email: kobayashi@iip.ist.i.kyoto-u.ac.jp organization: Graduate School of Informatics, Kyoto University – sequence: 6 givenname: Yusuke surname: Kobayashi fullname: Kobayashi, Yusuke organization: Research Institute for Mathematical Sciences, Kyoto University – sequence: 7 givenname: Kazuhiro surname: Kurita fullname: Kurita, Kazuhiro organization: National Institute of Informatics – sequence: 8 givenname: Yota surname: Otachi fullname: Otachi, Yota organization: Graduate School of Informatics, Nagoya University
BookMark	eNp9kE1LAzEQhoNUsK3-AU8LnqOzyX7lWKrWQkEP6jXE3UlN2Y-apFL99Wa7guChl0nemfdJXmZCRm3XIiGXMVzHAPmNA2AsoaHQXmd0f0LGccI5hUTA6HBnNOEpnJGJcxsA4AXAmKxmbbRstrb7xCq6RY-2Ma1x3pTRk7Kq6TvmO8xm9bqzxr83ke5sNFel37noFa3HfeBq9KZrz8mpVrXDi99zSl7u757nD3T1uFjOZyta8lh4WsYQg8i04GWhtSp0nqJ600loAMOUiyArlQqVVjlWCrkWohKqyFFlYSb4lFwN74bcHzt0Xm66nW3Dl5JlaSGKPGcsuIrBVdrOOYtalsarPqe3ytQyBtnvSg67k6EcdCb3AWX_0K01jbJfxyE-QC6Y2zXav1RHqB-v3YUV
CitedBy_id	crossref_primary_10_1016_j_jcss_2023_03_004 crossref_primary_10_1137_22M1468864 crossref_primary_10_1016_j_ipl_2022_106317 crossref_primary_10_1016_j_tcs_2024_115034
Cites_doi	10.1007/978-3-642-16533-7 10.1137/140997889 10.1016/j.dam.2017.10.018 10.1016/j.jcss.2006.02.001 10.1007/s00453-017-0317-1 10.1016/j.orl.2003.10.009 10.1007/s10878-013-9691-z 10.1145/1552285.1552286 10.1016/j.tcs.2010.06.026 10.1145/2629620 10.1137/S0097539792228228 10.1007/978-3-642-13036-6_15 10.1007/978-3-662-53536-3_20 10.1109/FOCS.2011.23 10.4230/LIPIcs.ISAAC.2020.34 10.4230/LIPIcs.IPEC.2019.22 10.1007/978-3-319-42634-1_7 10.1137/1.9781611975994.58 10.1007/978-3-642-34611-8_19
ContentType	Journal Article
Copyright	The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022 The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022.
Copyright_xml	– notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022 – notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022.
DBID	AAYXX CITATION 3V. 7SC 7WY 7WZ 7XB 87Z 88I 8AL 8AO 8FD 8FE 8FG 8FK 8FL ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FRNLG F~G GNUQQ HCIFZ JQ2 K60 K6~ K7- L.- L6V L7M L~C L~D M0C M0N M2P M7S P5Z P62 PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PRINS PTHSS PYYUZ Q9U
DOI	10.1007/s00224-022-10076-x
DatabaseName	CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Science Database (Alumni Edition) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni) Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials - QC ProQuest Central Business Premium Collection Technology Collection ProQuest One Community College ProQuest Central Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database ABI/INFORM Professional Advanced ProQuest Engineering Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ABI/INFORM Global Computing Database Science Database Engineering Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Business (UW System Shared) 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 ABI/INFORM Collection China ProQuest Central Basic
DatabaseTitle	CrossRef ProQuest Business Collection (Alumni Edition) Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts SciTech Premium Collection ProQuest Central China ABI/INFORM Complete ProQuest One Applied & Life Sciences ProQuest Central (New) Engineering Collection Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global Engineering Database ProQuest Science Journals (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest Business Collection ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ABI/INFORM Global (Corporate) ProQuest One Business Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest Pharma Collection ProQuest Central ABI/INFORM Professional Advanced ProQuest Engineering Collection ProQuest Central Korea Advanced Technologies Database with Aerospace ABI/INFORM Complete (Alumni Edition) ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Science Journals ProQuest Computing (Alumni Edition) ABI/INFORM China ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database Materials Science & Engineering Collection ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni)
DatabaseTitleList	ProQuest Business Collection (Alumni Edition)
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	1433-0490
EndPage	515
ExternalDocumentID	10_1007_s00224_022_10076_x
GrantInformation_xml	– fundername: Japan Society for the Promotion of Science grantid: JP18K11169 funderid: https://doi.org/10.13039/501100001691 – fundername: Japan Society for the Promotion of Science grantid: JP20H05793 funderid: https://doi.org/10.13039/501100001691 – fundername: Japan Society for the Promotion of Science grantid: JP20K11692 funderid: https://doi.org/10.13039/501100001691 – fundername: Japan Society for the Promotion of Science grantid: JP18H05291 funderid: https://doi.org/10.13039/501100001691 – fundername: Japan Society for the Promotion of Science grantid: JP20K19742 funderid: https://doi.org/10.13039/501100001691 – fundername: Japan Society for the Promotion of Science grantid: JP19K21537 funderid: https://doi.org/10.13039/501100001691 – fundername: Japan Society for the Promotion of Science grantid: JP18K11168 funderid: https://doi.org/10.13039/501100001691 – fundername: Japan Society for the Promotion of Science grantid: JP18H04091 funderid: https://doi.org/10.13039/501100001691
GroupedDBID	--Z -59 -5G -BR -EM -Y2 -~C -~X .4S .86 .DC .VR 06D 0R~ 0VY 123 1N0 2.D 203 29Q 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 3V. 4.4 406 408 409 40D 40E 5QI 5VS 67Z 6NX 7WY 88I 8AO 8FE 8FG 8FL 8TC 8UJ 8V8 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 ABDBF ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJCF ABJNI ABJOX ABKCH ABKTR ABLJU ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACGOD ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACUHS ACZOJ ADHIR ADIMF ADINQ ADKNI ADKPE ADMLS ADPHR ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMOZ AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGWIL AGWZB AGYKE AHAVH AHBYD AHQJS AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ AKVCP ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AOCGG ARAPS ARCSS ARMRJ AXYYD AYJHY AZFZN AZQEC B-. B0M BA0 BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ BSONS CAG CCPQU COF CS3 CSCUP D0L DDRTE DL5 DNIVK DPUIP DU5 DWQXO EAD EAP EBA EBLON EBR EBS EBU ECS EDO EIOEI EJD EMK EPL ESBYG EST ESX FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ3 GQ6 GQ7 GQ8 GROUPED_ABI_INFORM_COMPLETE GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ H~9 I-F I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K1G K60 K6V K6~ K7- KDC KOV L6V LAS LLZTM M0C M0N M2P M4Y M7S MA- MK~ ML~ NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P2P P62 P9O PF- PQBIZ PQBZA PQQKQ PROAC PT4 PT5 PTHSS Q2X QOK QOS R89 R9I RNI ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TH9 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WH7 WK8 XOL YLTOR Z45 Z7X Z83 Z88 Z8R Z8W Z92 ZMTXR ~8M AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFFHD AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP AMVHM ATHPR AYFIA CITATION PHGZM PHGZT PQGLB 7SC 7XB 8AL 8FD 8FK JQ2 L.- L7M L~C L~D PKEHL PQEST PQUKI PRINS Q9U
ID	FETCH-LOGICAL-c319t-c101096f93c8ffa8f75eabf4f9302e5395eada59a5d7edae3f99d9a87ea695e93
IEDL.DBID	RSV
ISICitedReferencesCount	4
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000784610300001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1432-4350
IngestDate	Wed Nov 05 08:21:38 EST 2025 Sat Nov 29 03:28:55 EST 2025 Tue Nov 18 22:33:34 EST 2025 Fri Feb 21 02:45:54 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	2
Keywords	Fixed-parameter tractable Measure and conquer analysis Cactus vertex deletion Even cycle transversal
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c319t-c101096f93c8ffa8f75eabf4f9302e5395eada59a5d7edae3f99d9a87ea695e93
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0003-3244-6915
PQID	2658987722
PQPubID	48907
PageCount	14
ParticipantIDs	proquest_journals_2658987722 crossref_citationtrail_10_1007_s00224_022_10076_x crossref_primary_10_1007_s00224_022_10076_x springer_journals_10_1007_s00224_022_10076_x
PublicationCentury	2000
PublicationDate	20220400 2022-04-00 20220401
PublicationDateYYYYMMDD	2022-04-01
PublicationDate_xml	– month: 4 year: 2022 text: 20220400
PublicationDecade	2020
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	Theory of computing systems
PublicationTitleAbbrev	Theory Comput Syst
PublicationYear	2022
Publisher	Springer US Springer Nature B.V
Publisher_xml	– name: Springer US – name: Springer Nature B.V
References	Dell, van Melkebeek (CR6) 2014; 61 Bodlaender, Ono, Otachi (CR2) 2018; 236 CR3 Chen, Kanj, Xia (CR4) 2010; 411 CR5 Becker, Bar-Yehuda, Geiger (CR1) 2000; 12 Feng, Wang, Li, Chen (CR8) 2015; 29 CR18 CR17 CR9 Fomin, Grandoni, Kratsch (CR10) 2009; 56 CR15 CR13 Kolay, Lokshtanov, Panolan, Saurabh (CR16) 2017; 79 Guo, Gramm, Hüffner, Niedermeier, Wernicke (CR14) 2006; 72 CR20 Reed, Smith, Vetta (CR19) 2004; 32 Downey, Fellows (CR7) 1995; 24 Fomin, Lokshtanov, Misra, Philip, Saurabh (CR12) 2016; 30 Fomin, Kratsch (CR11) 2010 RG Downey (10076_CR7) 1995; 24 HL Bodlaender (10076_CR2) 2018; 236 J Chen (10076_CR4) 2010; 411 10076_CR9 10076_CR3 Q Feng (10076_CR8) 2015; 29 10076_CR5 BA Reed (10076_CR19) 2004; 32 H Dell (10076_CR6) 2014; 61 10076_CR20 10076_CR15 A Becker (10076_CR1) 2000; 12 FV Fomin (10076_CR10) 2009; 56 10076_CR13 FV Fomin (10076_CR11) 2010 10076_CR17 10076_CR18 FV Fomin (10076_CR12) 2016; 30 J Guo (10076_CR14) 2006; 72 S Kolay (10076_CR16) 2017; 79
References_xml	– year: 2010 ident: CR11 publication-title: Exact Exponential Algorithms doi: 10.1007/978-3-642-16533-7 – ident: CR18 – volume: 12 start-page: 219 issue: 1 year: 2000 end-page: 234 ident: CR1 article-title: Randomized algorithms for the loop cutset problem publication-title: J. Artif. Int. Res. – volume: 30 start-page: 383 issue: 1 year: 2016 end-page: 410 ident: CR12 article-title: Hitting forbidden minors: Approximation and kernelization publication-title: SIAM J. Discret. Math. doi: 10.1137/140997889 – volume: 236 start-page: 42 year: 2018 end-page: 56 ident: CR2 article-title: A faster parameterized algorithm for Pseudoforest Deletion publication-title: Discret. Appl. Math. doi: 10.1016/j.dam.2017.10.018 – ident: CR3 – volume: 72 start-page: 1386 issue: 8 year: 2006 end-page: 1396 ident: CR14 article-title: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization publication-title: J. Comput. Syst. Sci. doi: 10.1016/j.jcss.2006.02.001 – ident: CR15 – ident: CR17 – volume: 79 start-page: 271 issue: 1 year: 2017 end-page: 290 ident: CR16 article-title: Quick but odd growth of cacti publication-title: Algorithmica doi: 10.1007/s00453-017-0317-1 – ident: CR13 – ident: CR9 – volume: 32 start-page: 299 issue: 4 year: 2004 end-page: 301 ident: CR19 article-title: Finding odd cycle transversals publication-title: Oper. Res. Lett. doi: 10.1016/j.orl.2003.10.009 – volume: 29 start-page: 125 issue: 1 year: 2015 end-page: 140 ident: CR8 article-title: Randomized parameterized algorithms for p2-packing and co-path packing problems publication-title: J. Comb. Optim. doi: 10.1007/s10878-013-9691-z – volume: 56 start-page: 25:1 issue: 5 year: 2009 end-page: 25:32 ident: CR10 article-title: A measure & conquer approach for the analysis of exact algorithms publication-title: J. ACM doi: 10.1145/1552285.1552286 – volume: 411 start-page: 3736 issue: 40-42 year: 2010 end-page: 3756 ident: CR4 article-title: Improved upper bounds for vertex cover publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2010.06.026 – ident: CR5 – volume: 61 start-page: 23:1 issue: 4 year: 2014 end-page: 23:27 ident: CR6 article-title: Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses publication-title: J. ACM doi: 10.1145/2629620 – volume: 24 start-page: 873 issue: 4 year: 1995 end-page: 921 ident: CR7 article-title: Fixed-parameter tractability and completeness i: basic results publication-title: SIAM J. Comput. doi: 10.1137/S0097539792228228 – ident: CR20 – ident: 10076_CR9 doi: 10.1007/978-3-642-13036-6_15 – volume-title: Exact Exponential Algorithms year: 2010 ident: 10076_CR11 doi: 10.1007/978-3-642-16533-7 – volume: 32 start-page: 299 issue: 4 year: 2004 ident: 10076_CR19 publication-title: Oper. Res. Lett. doi: 10.1016/j.orl.2003.10.009 – volume: 411 start-page: 3736 issue: 40-42 year: 2010 ident: 10076_CR4 publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2010.06.026 – volume: 72 start-page: 1386 issue: 8 year: 2006 ident: 10076_CR14 publication-title: J. Comput. Syst. Sci. doi: 10.1016/j.jcss.2006.02.001 – ident: 10076_CR3 doi: 10.1007/978-3-662-53536-3_20 – volume: 30 start-page: 383 issue: 1 year: 2016 ident: 10076_CR12 publication-title: SIAM J. Discret. Math. doi: 10.1137/140997889 – ident: 10076_CR5 doi: 10.1109/FOCS.2011.23 – ident: 10076_CR13 doi: 10.4230/LIPIcs.ISAAC.2020.34 – volume: 79 start-page: 271 issue: 1 year: 2017 ident: 10076_CR16 publication-title: Algorithmica doi: 10.1007/s00453-017-0317-1 – volume: 61 start-page: 23:1 issue: 4 year: 2014 ident: 10076_CR6 publication-title: J. ACM doi: 10.1145/2629620 – volume: 24 start-page: 873 issue: 4 year: 1995 ident: 10076_CR7 publication-title: SIAM J. Comput. doi: 10.1137/S0097539792228228 – ident: 10076_CR15 doi: 10.4230/LIPIcs.IPEC.2019.22 – volume: 236 start-page: 42 year: 2018 ident: 10076_CR2 publication-title: Discret. Appl. Math. doi: 10.1016/j.dam.2017.10.018 – ident: 10076_CR20 doi: 10.1007/978-3-319-42634-1_7 – volume: 29 start-page: 125 issue: 1 year: 2015 ident: 10076_CR8 publication-title: J. Comb. Optim. doi: 10.1007/s10878-013-9691-z – volume: 56 start-page: 25:1 issue: 5 year: 2009 ident: 10076_CR10 publication-title: J. ACM doi: 10.1145/1552285.1552286 – ident: 10076_CR17 doi: 10.1137/1.9781611975994.58 – ident: 10076_CR18 doi: 10.1007/978-3-642-34611-8_19 – volume: 12 start-page: 219 issue: 1 year: 2000 ident: 10076_CR1 publication-title: J. Artif. Int. Res.
SSID	ssj0003800
Score	2.290211
Snippet	A cactus is a connected graph that does not contain K 4 − e as a minor. Given a graph G = ( V , E ) and an integer k ≥ 0, Cactus Vertex Deletion (also known as... A cactus is a connected graph that does not contain K4 − e as a minor. Given a graph G = (V,E) and an integer k ≥ 0, Cactus Vertex Deletion (also known as...
SourceID	proquest crossref springer
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	502
SubjectTerms	Algorithms Apexes Cacti Computer Science Deletion Diamonds Parameterization Theory of Computation Vertex sets
SummonAdditionalLinks	– databaseName: Science Database dbid: M2P link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT8MwDLZgcIADgwFiMFAO3KBiTd8nNA0mDtu0A6DdqjRNAGl0Y-3QxK_HydJNILELl0pumrSqE9tx7M8Al4LZwrGlAh8MXcvljmex1FWkFEwGjp8yja7fDfr9cDiMBsbhlpuwylImakGdjrnykd9QVJW4Pw4ovZ18WKpqlDpdNSU0NmELLRtbhXT16GApiZ1Qp6CgSaAyg7ymSZrRqXNaeVkqll3RvjX_qZhW1uavA1KtdzrV_37xPuwZi5O0FlPkADZEVoNqWc2BmMVdg93eEsE1P4RuKyMLh4NIyZ2JmdGgzmTAVECXwnj-wrbW6AVfWry-EzR_SZvxYpaTZzEtxBz7KWjvcXYET537x_aDZSovWByXZGFxW52Y-TJyeCglC2XgCZZIF280qfCcCMmUeRHz0kCkTDgyitKIhYFgPrZFzjFUsnEmToD4LsoEN2Q-TYTKikXtlwQCDZMEd38Jtetgl7895gaWXFXHGMVLQGXNqhgvmvbjeR2uln0mC1COtU83Sv7EZoHm8Yo5dbguObxq_nu00_WjncEOVZNKx_Y0oFJMZ-Ictvln8ZZPL_T0_AY7MuqL priority: 102 providerName: ProQuest
Title	An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion
URI	https://link.springer.com/article/10.1007/s00224-022-10076-x https://www.proquest.com/docview/2658987722
Volume	66
WOSCitedRecordID	wos000784610300001&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: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1433-0490 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0003800 issn: 1432-4350 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/eLvHCXMwnV1LS8QwEB509aAH3-L6WHLwpoXtM8lxXRVBXYpvvZS0TXRBu7KtsvjrnWTbiqKCXgameVCSTGaSzHwDsC2FLV1bafBB5lle4vqWSD3NKikUdYNUGHT9E9rrsZsbHpZBYXnl7V49SZqdug52M-rG0t7nmg8stBynUN0xnbDh7Pyq3n9dZgJP0BDQ8UB-uwyV-b6Pz-row8b88ixqtM3h_P_-cwHmSuuSdMbLYREmZLYE81XmBlIK8hLMntZorfkynHQyMr5ckCnZL_1jDIAzCYV23tJ4zm9Y1nm8Hwz7xcMTQVOXdEVSvOTkSg4LOcJ2GsZ7kK3A5eHBRffIKrMsWAmKX2Eltn4dCxR3E6aUYIr6UsTKww9tR_ouRzYVPhd-SmUqpKs4T7lgVIoAy7i7Co1skMk1IIGH8u8xETix1BGwqOliKtEIifGkFzt2E-xqsKOkhCDXmTAeoxo82QxehMTwQTRqwk7d5nkMwPFr7c1qDqNSGPPIQSuLMzxGOE3Yrebso_jn3tb_Vn0DZhw97cavZxMaxfBFbsF08lr082ELJun1bQum9g564Rlyx9RCetruauqEmtJzpKF_1zIL-h1n1-g-
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT9wwEB4hQKIcWB5FLKXUB3oqUTfO-4CqFQ-BWFZ7gIpb6iTjFgmysMnClh_Fb2TGm-yqSHDj0Eskx7Elx59nxvbMNwA7qGx0bM3kg6FruanjWSpzuahR6cDxM2XY9TtBtxteXka9GXiqY2HYrbKWiUZQZ_2Uz8i_S1KVtD8OpPxxe2dx1ii-Xa1TaIxhcYp_H2jLVuydHND8fpXy6PB8_9iqsgpYKcGttFKbb4N8HTlpqLUKdeChSrRLL1oSPSeiYqa8SHlZgJlCR0dRFqkwQOVTHZMvkcifc5lZjF0FZW8i-Z3QhLyQCcKRSF6rCtIxoXpGWVrsO89l3xr9qwin1u2LC1mj544a_9sfWoalyqIW7fESWIEZzFehUWerEJXwWoXFswlDbbEGnXYuxgcqmImDyifIkFaLnmKHNeawfqS69vVvGmT550aQeS_2VVoOC_ETByWOqB1Tl_fzj3DxLiNch9m8n-MGCN8lmeeGypcJctQvafckQDK8EtrdJtJugl1Pc5xWtOuc_eM6nhBGG2jE9DBlPx414dukze2YdOTNr7dqPMSVACriKRiasFsjalr9em-bb_f2BRaOz886ceeke_oJPkgGtPFj2oLZcjDEzzCf3pdXxWDbLA0Bv94bac_KMkqO
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LS8QwEB5ERfTgW1yfOehJi9v0fRBZXBfFddmDinipaZuooF3d1udP89c5k213UdCbBy-FNE0hyZeZSTLzDcCGFKa0TEXkg75t2LHlGCKxqaikUJ7lJkKz6ze9Vsu_uAjaQ_BRxsKQW2UpE7WgTjoxnZHvcFSVuD_2ON9RhVtEu97Ye3g0KIMU3bSW6TR6EDmWby-4fct2j-o415ucNw5O9w-NIsOAESP0ciM26WbIVYEV-0oJX3mOFJGy8UWVS8cKsJgIJxBO4slESEsFQRII35PCxToiYkLxP-LhHpPcCdvOZV8LWL4Of0FzhKKSnGoRsKPD9rTiNMiPnsqu8fpVKQ4s3W-Xs1rnNab-82hNw2RhabNab2nMwJBMZ2GqzGLBCqE2CxMnfebabA6atZT1DlpkwuqFr5Ams2ZtQY5sxG39jnW1u2vsZH5zz9DsZ_sizp8ydi67OAjYjijNO-k8nP1JDxdgOO2kchGYa6MstH3h8khSNDBq_ciTaJBFuOuNuFkBs5zyMC7o2CkryF3YJ5LWMAnxoctu-FqBrX6bhx4Zya9fr5TYCAvBlIUDYFRgu0TXoPrnvy39_rd1GEOAhc2j1vEyjHPCtnZvWoHhvPskV2E0fs5vs-6aXiUMrv4aaJ90VlN6
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=An+Improved+Deterministic+Parameterized+Algorithm+for+Cactus+Vertex+Deletion&rft.jtitle=Theory+of+computing+systems&rft.au=Aoike%2C+Yuuki&rft.au=Gima%2C+Tatsuya&rft.au=Hanaka%2C+Tesshu&rft.au=Kiyomi%2C+Masashi&rft.date=2022-04-01&rft.issn=1432-4350&rft.eissn=1433-0490&rft.volume=66&rft.issue=2&rft.spage=502&rft.epage=515&rft_id=info:doi/10.1007%2Fs00224-022-10076-x&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s00224_022_10076_x
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1432-4350&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1432-4350&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1432-4350&client=summon