Faster Parameterized Algorithm for Cluster Vertex Deletion

In the Cluster Vertex Deletion problem the input is a graph G and an integer k . The goal is to decide whether there is a set of vertices S of size at most k such that the deletion of the vertices of S from G results in a graph in which every connected component is a clique. We give an algorithm for...

Full description

Saved in:

Bibliographic Details
Published in:	Theory of computing systems Vol. 65; no. 2; pp. 323 - 343
Main Author:	Tsur, Dekel
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.02.2021 Springer Nature B.V
Subjects:	Algorithms Apexes Clusters Computer Science Deletion Graph theory Theory of Computation Parameterized complexity Graph algorithms
ISSN:	1432-4350, 1433-0490
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	In the Cluster Vertex Deletion problem the input is a graph G and an integer k . The goal is to decide whether there is a set of vertices S of size at most k such that the deletion of the vertices of S from G results in a graph in which every connected component is a clique. We give an algorithm for Cluster Vertex Deletion whose running time is O ∗ (1.811 k ).
AbstractList	In the Cluster Vertex Deletion problem the input is a graph G and an integer k . The goal is to decide whether there is a set of vertices S of size at most k such that the deletion of the vertices of S from G results in a graph in which every connected component is a clique. We give an algorithm for Cluster Vertex Deletion whose running time is O ∗ (1.811 k ). In the Cluster Vertex Deletion problem the input is a graph G and an integer k. The goal is to decide whether there is a set of vertices S of size at most k such that the deletion of the vertices of S from G results in a graph in which every connected component is a clique. We give an algorithm for Cluster Vertex Deletion whose running time is O∗(1.811k).
Author	Tsur, Dekel
Author_xml	– sequence: 1 givenname: Dekel orcidid: 0000-0001-9763-3784 surname: Tsur fullname: Tsur, Dekel email: dekelts@cs.bgu.ac.il organization: Ben-Gurion University of the Negev
BookMark	eNp9kEtLw0AUhQepYK3-AVcB16N3Hslk3JVqVSjoQt0Ok_SmpqRJnZlS9dc7bQTBRVf3XDjffZxTMmi7Fgm5YHDFANS1B-BcUuBAYw8p3R6RIZNCUJAaBnvNqRQpnJBT75fRI3KAIbmZWh_QJc_W2RVGVX_jPBk3i87V4X2VVJ1LJs1m73lDF_AzucUGQ921Z-S4so3H8986Iq_Tu5fJA5093T9OxjNaCqYDrTKutFKyAJWzkhclZ5ZLW1QWZaEZcBSFzWSWZ1bNgc1TBlgwq4WutMzmqRiRy37u2nUfG_TBLLuNa-NKw2WeaslVpqKL967Sdd47rMza1SvrvgwDs8vI9BmZmJHZZ2S2Ecr_QWUd7O654GzdHEZFj_q4p12g-7vqAPUDXMF81Q
CitedBy_id	crossref_primary_10_1016_j_tcs_2022_10_044 crossref_primary_10_1007_s00453_023_01144_w crossref_primary_10_1016_j_tcs_2023_114178 crossref_primary_10_1016_j_tcs_2023_114321 crossref_primary_10_1007_s00453_025_01315_x crossref_primary_10_1016_j_tcs_2025_115081 crossref_primary_10_1134_S1064226924700360 crossref_primary_10_1016_j_tcs_2025_115483 crossref_primary_10_1016_j_tcs_2023_114041 crossref_primary_10_1007_s00224_024_10161_3
Cites_doi	10.1007/s00453-008-9199-6 10.1016/j.disopt.2015.11.003 10.1007/s00453-004-1090-5 10.1016/j.ipl.2014.06.018 10.1089/106652799318274 10.1007/s00224-008-9150-x 10.1016/j.tcs.2019.03.013 10.1023/B:MACH.0000033116.57574.95 10.1007/s00224-015-9631-7 10.1007/978-3-319-21275-3 10.1016/j.tcs.2009.11.012 10.1016/j.ipl.2015.12.002 10.1016/0020-0190(96)00050-6 10.1007/978-3-319-55911-7_47 10.1007/978-3-319-21398-9_37 10.1145/2897518.2897551
ContentType	Journal Article
Copyright	Springer Science+Business Media, LLC, part of Springer Nature 2020 Springer Science+Business Media, LLC, part of Springer Nature 2020.
Copyright_xml	– notice: Springer Science+Business Media, LLC, part of Springer Nature 2020 – notice: Springer Science+Business Media, LLC, part of Springer Nature 2020.
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-020-10005-w
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 ProQuest Central (subscription) 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 (New) 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	343
ExternalDocumentID	10_1007_s00224_020_10005_w
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-f6279774b0781c2bc21a24abfae4b9102e3ba64686a7d01d510eb1a939f946d53
IEDL.DBID	M2P
ISICitedReferencesCount	19
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000583481300001&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	Tue Nov 04 23:10:04 EST 2025 Sat Nov 29 03:28:55 EST 2025 Tue Nov 18 21:23:06 EST 2025 Fri Feb 21 02:48:57 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	2
Keywords	Parameterized complexity Graph algorithms
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c319t-f6279774b0781c2bc21a24abfae4b9102e3ba64686a7d01d510eb1a939f946d53
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0001-9763-3784
PQID	2485942767
PQPubID	48907
PageCount	21
ParticipantIDs	proquest_journals_2485942767 crossref_primary_10_1007_s00224_020_10005_w crossref_citationtrail_10_1007_s00224_020_10005_w springer_journals_10_1007_s00224_020_10005_w
PublicationCentury	2000
PublicationDate	20210200 2021-02-00 20210201
PublicationDateYYYYMMDD	2021-02-01
PublicationDate_xml	– month: 2 year: 2021 text: 20210200
PublicationDecade	2020
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	Theory of computing systems
PublicationTitleAbbrev	Theory Comput Syst
PublicationYear	2021
Publisher	Springer US Springer Nature B.V
Publisher_xml	– name: Springer US – name: Springer Nature B.V
References	Tsur (CR13) 2019; 783 Cygan, Fomin, Kowalik, Lokshtanov, Marx, Pilipczuk, Saurabh (CR6) 2015 Boral, Cygan, Kociumaka, Pilipczuk (CR3) 2016; 58 Fomin, Gaspers, Kratsch, Liedloff, Saurabh (CR8) 2010; 411 CR17 CR9 Hüffner, Komusiewicz, Moser, Niedermeier (CR11) 2010; 47 CR16 Bansal, Blum, Chawla (CR1) 2004; 56 CR15 Tu (CR14) 2015; 115 Ben-Dor, Shamir, Yakhini (CR2) 1999; 6 Fernau (CR7) 2010; 57 Chang, Chen, Hung, Rossmanith, Su (CR5) 2016; 19 Cai (CR4) 1996; 58 Katrenič (CR12) 2016; 116 Gramm, Guo, Hüffner, Niedermeier (CR10) 2004; 39 M-S Chang (10005_CR5) 2016; 19 H Fernau (10005_CR7) 2010; 57 F Hüffner (10005_CR11) 2010; 47 A Boral (10005_CR3) 2016; 58 J Gramm (10005_CR10) 2004; 39 J Katrenič (10005_CR12) 2016; 116 10005_CR17 J Tu (10005_CR14) 2015; 115 10005_CR15 A Ben-Dor (10005_CR2) 1999; 6 10005_CR16 N Bansal (10005_CR1) 2004; 56 L Cai (10005_CR4) 1996; 58 M Cygan (10005_CR6) 2015 D Tsur (10005_CR13) 2019; 783 10005_CR9 FV Fomin (10005_CR8) 2010; 411
References_xml	– volume: 57 start-page: 97 issue: 1 year: 2010 end-page: 118 ident: CR7 article-title: A top-down approach to search-trees: improved algorithmics for 3-hitting set publication-title: Algorithmica doi: 10.1007/s00453-008-9199-6 – volume: 19 start-page: 12 year: 2016 end-page: 22 ident: CR5 article-title: Fixed-parameter algorithms for vertex cover P3 publication-title: Discrete Optim. doi: 10.1016/j.disopt.2015.11.003 – volume: 39 start-page: 321 issue: 4 year: 2004 end-page: 347 ident: CR10 article-title: Automated generation of search tree algorithms for hard graph modification problems publication-title: Algorithmica doi: 10.1007/s00453-004-1090-5 – volume: 115 start-page: 96 issue: 2 year: 2015 end-page: 99 ident: CR14 article-title: A fixed-parameter algorithm for the vertex cover P3 problem publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2014.06.018 – ident: CR15 – volume: 6 start-page: 281 issue: 3–4 year: 1999 end-page: 297 ident: CR2 article-title: Clustering gene expression patterns publication-title: J. Comput. Biol. doi: 10.1089/106652799318274 – ident: CR16 – volume: 47 start-page: 196 issue: 1 year: 2010 end-page: 217 ident: CR11 article-title: Fixed-parameter algorithms for cluster vertex deletion publication-title: Theory Comput. Syst. doi: 10.1007/s00224-008-9150-x – volume: 783 start-page: 1 year: 2019 end-page: 8 ident: CR13 article-title: Parameterized algorithm for 3-path vertex cover publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2019.03.013 – ident: CR17 – volume: 56 start-page: 89 issue: 1–3 year: 2004 end-page: 113 ident: CR1 article-title: Correlation clustering publication-title: Mach. Learn. doi: 10.1023/B:MACH.0000033116.57574.95 – volume: 58 start-page: 357 issue: 2 year: 2016 end-page: 376 ident: CR3 article-title: A fast branching algorithm for cluster vertex deletion publication-title: Theory Comput. Syst. doi: 10.1007/s00224-015-9631-7 – ident: CR9 – year: 2015 ident: CR6 publication-title: Parameterized Algorithms doi: 10.1007/978-3-319-21275-3 – volume: 411 start-page: 1045 issue: 7–9 year: 2010 end-page: 1053 ident: CR8 article-title: Iterative compression and exact algorithms publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2009.11.012 – volume: 116 start-page: 273 issue: 4 year: 2016 end-page: 278 ident: CR12 article-title: A faster FPT algorithm for 3-path vertex cover publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2015.12.002 – volume: 58 start-page: 171 issue: 4 year: 1996 end-page: 176 ident: CR4 article-title: Fixed-parameter tractability of graph modification problems for hereditary properties publication-title: Inf. Process. Lett. doi: 10.1016/0020-0190(96)00050-6 – volume: 56 start-page: 89 issue: 1–3 year: 2004 ident: 10005_CR1 publication-title: Mach. Learn. doi: 10.1023/B:MACH.0000033116.57574.95 – ident: 10005_CR17 doi: 10.1007/978-3-319-55911-7_47 – volume: 115 start-page: 96 issue: 2 year: 2015 ident: 10005_CR14 publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2014.06.018 – ident: 10005_CR16 doi: 10.1007/978-3-319-21398-9_37 – volume-title: Parameterized Algorithms year: 2015 ident: 10005_CR6 doi: 10.1007/978-3-319-21275-3 – volume: 411 start-page: 1045 issue: 7–9 year: 2010 ident: 10005_CR8 publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2009.11.012 – volume: 58 start-page: 357 issue: 2 year: 2016 ident: 10005_CR3 publication-title: Theory Comput. Syst. doi: 10.1007/s00224-015-9631-7 – volume: 19 start-page: 12 year: 2016 ident: 10005_CR5 publication-title: Discrete Optim. doi: 10.1016/j.disopt.2015.11.003 – volume: 57 start-page: 97 issue: 1 year: 2010 ident: 10005_CR7 publication-title: Algorithmica doi: 10.1007/s00453-008-9199-6 – volume: 783 start-page: 1 year: 2019 ident: 10005_CR13 publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2019.03.013 – ident: 10005_CR15 – volume: 6 start-page: 281 issue: 3–4 year: 1999 ident: 10005_CR2 publication-title: J. Comput. Biol. doi: 10.1089/106652799318274 – volume: 39 start-page: 321 issue: 4 year: 2004 ident: 10005_CR10 publication-title: Algorithmica doi: 10.1007/s00453-004-1090-5 – volume: 58 start-page: 171 issue: 4 year: 1996 ident: 10005_CR4 publication-title: Inf. Process. Lett. doi: 10.1016/0020-0190(96)00050-6 – volume: 116 start-page: 273 issue: 4 year: 2016 ident: 10005_CR12 publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2015.12.002 – ident: 10005_CR9 doi: 10.1145/2897518.2897551 – volume: 47 start-page: 196 issue: 1 year: 2010 ident: 10005_CR11 publication-title: Theory Comput. Syst. doi: 10.1007/s00224-008-9150-x
SSID	ssj0003800
Score	2.4004912
Snippet	In the Cluster Vertex Deletion problem the input is a graph G and an integer k . The goal is to decide whether there is a set of vertices S of size at most k... In the Cluster Vertex Deletion problem the input is a graph G and an integer k. The goal is to decide whether there is a set of vertices S of size at most k...
SourceID	proquest crossref springer
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	323
SubjectTerms	Algorithms Apexes Clusters Computer Science Deletion Graph theory Theory of Computation
SummonAdditionalLinks	– databaseName: SpringerLINK Contemporary 1997-Present dbid: RSV link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT8JAEJ4oetCDKGpE0fTgTZu0y_ax3ghKvEiID8Kt2aeSIJhSxPjr3V3aEo2a6LnTTTO7M_NtZ-YbgNMo4kIowlwRcc-kGYlLAy5c7iukEFYCU88Om4i63XgwIL28KWxaVLsXKUnrqctmNxtuXHPdMf-kA3e-Cms63MVmYMPtXb_0v83YNp5oIGD6gQIvb5X5fo3P4WiJMb-kRW206VT_953bsJWjS6e1OA47sCLHNagWkxuc3JBrsHlTsrVOd-GiQw1dgtOjplLLkDe_S-G0Ro-TdJg9PTsa1zrt0czK9GWayTfnUhrS7sl4Dx46V_ftazefqeBybWyZq0IUGcjHDMkPR4wjnyJMmaISMw0dkGwyGuIwDmkkPF9ok9XenJImUQSHImjuQ2U8GcsDcBSmvr7taMQQEyyYisOAEREwJLVRU8Hq4BeqTXhOOG7mXoySkirZqirRqkqsqpJ5Hc7Kd14WdBu_SjeKHUty05smhqONYBSFUR3Oix1aPv55tcO_iR_BBjL1LbaCuwGVLJ3JY1jnr9lwmp7YI_kBqbnaGw priority: 102 providerName: Springer Nature
Title	Faster Parameterized Algorithm for Cluster Vertex Deletion
URI	https://link.springer.com/article/10.1007/s00224-020-10005-w https://www.proquest.com/docview/2485942767
Volume	65
WOSCitedRecordID	wos000583481300001&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/eLvHCXMwpV3db9MwED_t6wEeGAwQZaPKA2-bReI6cbyXaSurJqFW0TbG4CXyJyCVdrTZhvjr5_OcViCxF15OiuI4Uc53_tm--x3AW861MU4oYrhO8ZhREJlrQ3TmqKPMGSbTUGyCj0bl5aWo4obbPIZVtj4xOGoz1bhH_g6ptwSjvOAHVz8JVo3C09VYQmMV1j2yyTCka0irhSfulSEFxUMCzAzK05g0E1LnwuRFcPGEO9w5uf1zYlqizb8OSMO8M9j83y9-Ck8i4kwO74fIM1ixky3YbKs5JNG4t-DxcMHgOn8O-wOJFApJJTF6Cwmdf1uTHI6_-jc0334kHusm_fF1aHNhZ439lby3SOQ9nbyAj4Pj8_4JiXUWiPYG2BBXUI4wUCHxj6ZK00xSJpWTlikPJ6jtKVmwoiwkN2lmvBl7Dy9FTzjBCpP3XsLaZDqxryBxTGZ-BeRRRCmYUa4sciVMrqj1hi6N6kDW_uRaRxJyrIUxrhf0yUExtVdMHRRT33Zgd_HM1T0Fx4Otd1pt1NEc5_VSFR3Ya_W5vP3v3l4_3Ns2PKIY4xKiuHdgrZld2zewoW-a7_NZF1b5p89dWD86HlWn_uoDJ14O0343DFOU_MzLKv_i5enZxR0yfesl
linkProvider	ProQuest
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1NTxsxEB0hilQ4AAUqQin1AU5gNet4P4xUVSghAgFRDoC4bf3ZVgoJJEtT-qP6G-txdhMVqdw49LxeS955fjNez7wB2E1TbYwTippU1_GaUVAZa0N15Jhj3Bku66HZRNrpZDc3ojsHv6taGEyrrDgxELUZaPxH_hGltwRnaZJ-vrun2DUKb1erFhoTWJzZx7E_so0-nba8ffcYax9fNk9o2VWAag-3grqEpRj0KJS50UxpFknGpXLScuWdJ7MNJROeZIlMTT0yHrSez6RoCCd4YrBLhKf8VxyVxTBVkHWnzN_IQsmLD0GwEimul0U6oVQvOEuKhzX8ox7T8d-OcBbdPrmQDX6uvfK_faFVWC4janI02QJvYM7212Cl6lZBSvJag6WLqULtaB0O2xIlIkhXYnYaClb_soYc9b76FRXfbomP5Umz9xDGXNthYX-SlkWh8kF_A65eZD1vYb4_6NtNII7LyJ_wfJSUCW6Uy5JYCRMrZj2RSaNqEFVGzXUpso69Pnr5VB46ACH3QMgDEPJxDfan79xNJEaeHb1dWT8v6WaUz0xfg4MKP7PH_55t6_nZPsDrk8uL8_z8tHP2DhYZ5vOEjPVtmC-GD_Y9LOgfxffRcCdsBAJfXhpXfwBtUz-w
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1NbxMxEB1VLUJwaKFQkbaAD3ACq1nHu14jIVQ1RFSFKAdAFZfFn4AUkjZJG8FP49cx4-wmAoneeuC8XkvefX4zY8-8AXiilPM-asu9cm26ZtTc5M5zl0URhYxemnZqNqH6_fL0VA_W4FdTC0NplQ0nJqL2Y0dn5AckvaWlUIU6iHVaxKDbe3V2zqmDFN20Nu00FhA5CT_mGL5NXx538V8_FaL3-v3RG153GOAOoTfjsRCKHCBLkjdOWCcyI6Sx0QRp0ZCK0LGmkEVZGOXbmUcAI7cZ3dFRy8JTxwik_w2FMSalEw7yT0sr0ClT-Qu6I1SVlLfrgp1UtpcMJ6fAjU7Xcz7_0yiuPN2_LmeTzett_c9f6w5s1p42O1xsjbuwFkbbsNV0sWA1qW3D7XdL5drpPXjRMyQdwQaGstZIyPpn8Oxw-AVXNPv6naGPz46GF2nMxzDBJbNuIAHz8eg-fLiW9ezA-mg8Cg-ARWkyjPzQeyq19DaWRW61z60ISHDG2xZkzQ-uXC2-Tj1AhtVSNjqBokJQVAkU1bwFz5bvnC2kR64cvd8goappaFqtYNCC5w2WVo__Pdvu1bM9hpsIp-rtcf9kD24JSvNJiez7sD6bXISHcMNdzr5NJ4_SnmDw-bph9Rt28Eic
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=Faster+Parameterized+Algorithm+for+Cluster+Vertex+Deletion&rft.jtitle=Theory+of+computing+systems&rft.au=Tsur+Dekel&rft.date=2021-02-01&rft.pub=Springer+Nature+B.V&rft.issn=1432-4350&rft.eissn=1433-0490&rft.volume=65&rft.issue=2&rft.spage=323&rft.epage=343&rft_id=info:doi/10.1007%2Fs00224-020-10005-w&rft.externalDBID=HAS_PDF_LINK
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