An improved FPT algorithm for Almost Forest Deletion problem
Almost Forest Deletion problem (AFD) is a generalization of the Feedback Vertex Set problem, which decides whether there exist at most k vertices in a given graph G whose removal from G results in an l-forest, where k and l are two given non-negative integers, and an l-forest is a graph which can be...
Gespeichert in:
| Veröffentlicht in: | Information processing letters Jg. 136; S. 30 - 36 |
|---|---|
| Hauptverfasser: | , , , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier B.V
01.08.2018
|
| Schlagworte: | |
| ISSN: | 0020-0190, 1872-6119 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Almost Forest Deletion problem (AFD) is a generalization of the Feedback Vertex Set problem, which decides whether there exist at most k vertices in a given graph G whose removal from G results in an l-forest, where k and l are two given non-negative integers, and an l-forest is a graph which can be transformed into a forest by deleting at most l edges. Based on the iterative compression technique, we study the iterative version of the AFD problem, called Almost Forest Deletion Disjoint Compression problem (AFDDC), which asks for a new l-forest deletion set X′ of size at most k for a given graph G that is disjoint with a given l-forest deletion set X of graph G for two given non-negative integers k and l. For the AFDDC problem, we develop some reduction rules to simplify a given instance, and give a new branching algorithm for the problem. A new branching measure is presented to evaluate the efficiency of the algorithm, which results in an algorithm of running time O⁎(4k+l). Based on the proposed algorithm for the AFDDC problem, a parameterized algorithm for the AFD problem with running time O⁎(5k4l) is presented, improving the previous result O⁎(5.0024(k+l)).
•Studying a generalization of the FVS problem, called Almost Forest Deletion problem.•Presenting some reduction rules and branching rules to deal with the problem.•Introducing a measure with uniform coefficient to analyze the branching algorithm.•Developing a new parameterized algorithm with running time O⁎(5k4l) for the problem. |
|---|---|
| AbstractList | Almost Forest Deletion problem (AFD) is a generalization of the Feedback Vertex Set problem, which decides whether there exist at most k vertices in a given graph G whose removal from G results in an l-forest, where k and l are two given non-negative integers, and an l-forest is a graph which can be transformed into a forest by deleting at most l edges. Based on the iterative compression technique, we study the iterative version of the AFD problem, called Almost Forest Deletion Disjoint Compression problem (AFDDC), which asks for a new l-forest deletion set X′ of size at most k for a given graph G that is disjoint with a given l-forest deletion set X of graph G for two given non-negative integers k and l. For the AFDDC problem, we develop some reduction rules to simplify a given instance, and give a new branching algorithm for the problem. A new branching measure is presented to evaluate the efficiency of the algorithm, which results in an algorithm of running time O⁎(4k+l). Based on the proposed algorithm for the AFDDC problem, a parameterized algorithm for the AFD problem with running time O⁎(5k4l) is presented, improving the previous result O⁎(5.0024(k+l)).
•Studying a generalization of the FVS problem, called Almost Forest Deletion problem.•Presenting some reduction rules and branching rules to deal with the problem.•Introducing a measure with uniform coefficient to analyze the branching algorithm.•Developing a new parameterized algorithm with running time O⁎(5k4l) for the problem. |
| Author | Fu, Bin Feng, Qilong Chen, Jianer Lin, Mugang Li, Wenjun Wang, Jianxin |
| Author_xml | – sequence: 1 givenname: Mugang surname: Lin fullname: Lin, Mugang organization: School of Information Science and Engineering, Central South University, Changsha, China – sequence: 2 givenname: Qilong surname: Feng fullname: Feng, Qilong email: csufeng@csu.edu.cn organization: School of Information Science and Engineering, Central South University, Changsha, China – sequence: 3 givenname: Jianxin surname: Wang fullname: Wang, Jianxin organization: School of Information Science and Engineering, Central South University, Changsha, China – sequence: 4 givenname: Jianer surname: Chen fullname: Chen, Jianer organization: Department of Computer Science and Engineering, Texas A&M University, College Station, TX 77843-3112, USA – sequence: 5 givenname: Bin surname: Fu fullname: Fu, Bin organization: Department of Computer Science, University of Texas Rio Grande Valley, Edinburg, USA – sequence: 6 givenname: Wenjun surname: Li fullname: Li, Wenjun organization: School of Computer and Communication Engineering, Changsha University of Science and Technology, Changsha, China |
| BookMark | eNp9j81KAzEURoNUsK0-gLu8wIw3SZOZQTelWhUKuqjrkOZHU2YmJRkKvr0Z6qqLrr7Lxz2Xe2Zo0ofeInRPoCRAxMO-9Ie2pEDqEliZmys0JXVFC0FIM0FTAAoFkAZu0CylPQCIBaum6GnZY98dYjhag9efW6za7xD98NNhFyJetl1IA16HaHM829YOPvQ47-9a292ia6faZO_-c46-1i_b1Vux-Xh9Xy03haZNNRSN0VC7RcO4Msxw7bgRO8OFoGKcuaiYI0ZwzYnRooEFUMocY0TYWu1qweaInO7qGFKK1slD9J2Kv5KAHPXlXmZ9OepLYDI3manOGO0HNX4_ROXbi-TjibRZ6ehtlEl722trfLR6kCb4C_QfzRp2WA |
| CitedBy_id | crossref_primary_10_1007_s10878_018_0340_4 crossref_primary_10_1109_JSYST_2019_2892002 crossref_primary_10_1109_JSYST_2019_2922373 crossref_primary_10_1109_JSYST_2019_2937960 crossref_primary_10_1016_j_tcs_2023_113798 crossref_primary_10_1109_JIOT_2018_2872133 crossref_primary_10_1016_j_tcs_2019_08_009 crossref_primary_10_1016_j_ipl_2022_106317 crossref_primary_10_1016_j_tcs_2024_115034 crossref_primary_10_1007_s00453_023_01206_z |
| Cites_doi | 10.1613/jair.638 10.1016/j.ic.2009.10.001 10.1137/110843071 10.1007/s10878-011-9394-2 10.1109/TST.2014.6867520 10.1016/j.orl.2003.10.009 10.1016/j.tcs.2017.09.024 10.1016/j.tcs.2016.06.044 10.1137/S0895480196305124 10.1016/j.ic.2016.11.003 10.1016/S0004-3702(02)00182-0 10.1016/j.ipl.2014.05.001 10.1109/TMC.2017.2696009 10.1016/j.jcss.2008.05.002 10.1007/s00453-015-0087-6 10.1016/j.tcs.2017.09.027 10.1007/BF00993316 10.1016/j.jcss.2006.02.001 10.1016/j.tcs.2012.02.012 10.1016/0004-3702(95)00004-6 10.1016/j.tcs.2016.06.012 10.1007/s00453-014-9904-6 |
| ContentType | Journal Article |
| Copyright | 2018 Elsevier B.V. |
| Copyright_xml | – notice: 2018 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.ipl.2018.03.016 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1872-6119 |
| EndPage | 36 |
| ExternalDocumentID | 10_1016_j_ipl_2018_03_016 S0020019018300772 |
| GrantInformation_xml | – fundername: Open Fund Project of Hunan Provincial Key Laboratory of Intelligent Information Processing and Application for Hengyang Normal University – fundername: Science and Technology Plan Project of Hunan Province grantid: 2016TP1020 – fundername: Scientific Research Fund of Hunan Provincial Education Department grantid: 17C0222 – fundername: National Natural Science Foundation of China grantid: 61472449; 61772179; 61420106009; 61402054; 61572414; 71631008 funderid: https://doi.org/10.13039/501100001809 – fundername: Hengyang Foundation for Development of Science and Technology grantid: 2016KG39 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 29I 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABEFU ABFNM ABFSI ABJNI ABMAC ABTAH ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADJOM ADMUD AEBSH AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 E.L EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HMJ HVGLF HZ~ IHE J1W KOM LG9 M26 M41 MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SES SEW SME SPC SPCBC SSV SSZ T5K TN5 UQL WH7 WUQ XPP ZMT ZY4 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c297t-9dc08f4935ad3d5cf5d6bd56626cf5d5673f1d65c51dc69040223f3316e8ab863 |
| ISICitedReferencesCount | 13 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000435045200008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0020-0190 |
| IngestDate | Sat Nov 29 03:44:22 EST 2025 Tue Nov 18 21:18:50 EST 2025 Fri Feb 23 02:16:28 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Iterative compression Almost forest deletion Graph algorithms Feedback vertex set Fixed-parameter algorithm |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c297t-9dc08f4935ad3d5cf5d6bd56626cf5d5673f1d65c51dc69040223f3316e8ab863 |
| PageCount | 7 |
| ParticipantIDs | crossref_primary_10_1016_j_ipl_2018_03_016 crossref_citationtrail_10_1016_j_ipl_2018_03_016 elsevier_sciencedirect_doi_10_1016_j_ipl_2018_03_016 |
| PublicationCentury | 2000 |
| PublicationDate | August 2018 2018-08-00 |
| PublicationDateYYYYMMDD | 2018-08-01 |
| PublicationDate_xml | – month: 08 year: 2018 text: August 2018 |
| PublicationDecade | 2010 |
| PublicationTitle | Information processing letters |
| PublicationYear | 2018 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Cygan, Nederlof, Pilipczuk, Pilipczuk, van Rooij, Wojtaszczyk (br0120) 2011 Molina, Ullman, Widom (br0300) 2009 Rai, Saurabh (br0330) 2015; vol. 9198 Bafna, Berman, Fujito (br0010) 1999; 12 Misra, Philip, Raman, Saurabh (br0280) 2012; 461 Chen, Shi, Wang (br0090) 2016; 76 Becker, Geiger (br0030) 1996; 83 Chakradhar, Balakrishnan, Agrawal (br0070) 1995; 7 Philip, Rai, Saurabh (br0320) 2015; vol. 9235 Reed, Smith, Vetta (br0340) 2004; 32 Lin, Feng, Chen, Li (br0270) 2017; 657 Karp (br0230) 1972 Guo, Gramm, Huffner, Niedermeier, Wernicke (br0200) 2006; 72 Chen, Fomin, Liu, Lu, Villanger (br0080) 2008; 74 Chen, Xu, Wang (br0100) 2015; vol. 9214 Downey, Fellows (br0140) 1999 Cao, Chen, Liu (br0060) 2015; 73 Cygan, Pilipczuk, Pilipczuk, Wojtaszczyk (br0130) 2013; 27 Xiao, Nagamochi (br0360) 2013; vol. 8287 Gottlob, Scarcello, Sideri (br0190) 2002; 138 Misra, Philip, Raman, Saurabh, Sikdar (br0290) 2012; 24 Li, Cao, Chen, Wang (br0260) 2017; 252 Jansen, Raman, Vatshelle (br0220) 2014; 19 Niedermeier (br0310) 2006 Fomin, Stromme (br0170) 2016 Kociumaka, Pilipczuk (br0240) 2014; 114 Cygan, Fomin, Kowalik, Lokshtanov, Marx, Pilipczuk, Pilipczuk, Saurabh (br0110) 2015 Guo, Shen, Zhu (br0210) 2017; 16 Bodlaender, Ono, Otachi (br0050) 2017; vol. 63 Fomin, Gaspers, Pyatkin (br0180) 2006; vol. 4169 Silberschatz, Galvin (br0350) 1994 Feng, Huang, Jiang, Wang (br0150) 2017 Bar-Yehuda, Becker, Geiger (br0020) 2000; 12 Betzler, Guo, Niedermeier (br0040) 2010; 208 Feng, Li, Zhou, Wang (br0160) 2017 Li, Feng, Chen, Hu (br0250) 2017; 657 Guo (10.1016/j.ipl.2018.03.016_br0210) 2017; 16 Cygan (10.1016/j.ipl.2018.03.016_br0130) 2013; 27 Kociumaka (10.1016/j.ipl.2018.03.016_br0240) 2014; 114 Philip (10.1016/j.ipl.2018.03.016_br0320) 2015; vol. 9235 Fomin (10.1016/j.ipl.2018.03.016_br0170) Misra (10.1016/j.ipl.2018.03.016_br0290) 2012; 24 Guo (10.1016/j.ipl.2018.03.016_br0200) 2006; 72 Cao (10.1016/j.ipl.2018.03.016_br0060) 2015; 73 Chakradhar (10.1016/j.ipl.2018.03.016_br0070) 1995; 7 Bodlaender (10.1016/j.ipl.2018.03.016_br0050) 2017; vol. 63 Chen (10.1016/j.ipl.2018.03.016_br0100) 2015; vol. 9214 Bar-Yehuda (10.1016/j.ipl.2018.03.016_br0020) 2000; 12 Cygan (10.1016/j.ipl.2018.03.016_br0110) 2015 Betzler (10.1016/j.ipl.2018.03.016_br0040) 2010; 208 Fomin (10.1016/j.ipl.2018.03.016_br0180) 2006; vol. 4169 Karp (10.1016/j.ipl.2018.03.016_br0230) 1972 Niedermeier (10.1016/j.ipl.2018.03.016_br0310) 2006 Molina (10.1016/j.ipl.2018.03.016_br0300) 2009 Cygan (10.1016/j.ipl.2018.03.016_br0120) 2011 Chen (10.1016/j.ipl.2018.03.016_br0090) 2016; 76 Becker (10.1016/j.ipl.2018.03.016_br0030) 1996; 83 Feng (10.1016/j.ipl.2018.03.016_br0150) 2017 Li (10.1016/j.ipl.2018.03.016_br0250) 2017; 657 Bafna (10.1016/j.ipl.2018.03.016_br0010) 1999; 12 Xiao (10.1016/j.ipl.2018.03.016_br0360) 2013; vol. 8287 Jansen (10.1016/j.ipl.2018.03.016_br0220) 2014; 19 Feng (10.1016/j.ipl.2018.03.016_br0160) 2017 Lin (10.1016/j.ipl.2018.03.016_br0270) 2017; 657 Silberschatz (10.1016/j.ipl.2018.03.016_br0350) 1994 Li (10.1016/j.ipl.2018.03.016_br0260) 2017; 252 Downey (10.1016/j.ipl.2018.03.016_br0140) 1999 Rai (10.1016/j.ipl.2018.03.016_br0330) 2015; vol. 9198 Misra (10.1016/j.ipl.2018.03.016_br0280) 2012; 461 Reed (10.1016/j.ipl.2018.03.016_br0340) 2004; 32 Chen (10.1016/j.ipl.2018.03.016_br0080) 2008; 74 Gottlob (10.1016/j.ipl.2018.03.016_br0190) 2002; 138 |
| References_xml | – volume: 12 start-page: 289 year: 1999 end-page: 297 ident: br0010 article-title: A 2-approximation algorithm for the undirected feedback vertex set problem publication-title: SIAM J. Discrete Math. – volume: 27 start-page: 290 year: 2013 end-page: 309 ident: br0130 article-title: Subset feedback vertex set is fixed-parameter tractable publication-title: SIAM J. Discrete Math. – volume: vol. 9235 start-page: 517 year: 2015 end-page: 528 ident: br0320 article-title: Generalized pseudoforest deletion: algorithms and uniform kernel publication-title: Proc. MFCS 2015 – volume: vol. 8287 start-page: 153 year: 2013 end-page: 164 ident: br0360 article-title: An improved exact algorithm for undirected feedback vertex set publication-title: Proc. COCOA 2013 – volume: 76 start-page: 867 year: 2016 end-page: 889 ident: br0090 article-title: Approximating maximum agreement forest on multiple binary trees publication-title: Algorithmica – volume: 7 start-page: 83 year: 1995 end-page: 93 ident: br0070 article-title: An exact algorithm for selecting partial scan flip-flops publication-title: J. Electron. Test. – volume: vol. 4169 start-page: 184 year: 2006 end-page: 191 ident: br0180 article-title: Finding a minimum feedback vertex set in time publication-title: Proc. IWPEC 2006 – volume: 19 start-page: 387 year: 2014 end-page: 409 ident: br0220 article-title: Parameter ecology for feedback vertex set publication-title: Tsinghua Sci. Technol. – volume: 72 start-page: 1386 year: 2006 end-page: 1396 ident: br0200 article-title: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization publication-title: J. Comput. Syst. Sci. – volume: 24 start-page: 131 year: 2012 end-page: 146 ident: br0290 article-title: FPT algorithms for connected feedback vertex set publication-title: J. Comb. Optim. – year: 2009 ident: br0300 article-title: Database Systems: the Complete Book – year: 2017 ident: br0150 article-title: Dealing with several parameterized problems by random methods publication-title: Theor. Comput. Sci. – volume: 657 start-page: 11 year: 2017 end-page: 19 ident: br0270 article-title: Partition on trees with supply and demand: kernelization and algorithms publication-title: Theor. Comput. Sci. – volume: 208 start-page: 165 year: 2010 end-page: 177 ident: br0040 article-title: Parameterized computational complexity of Dodgson and Young elections publication-title: Inf. Comput. – volume: 16 start-page: 3320 year: 2017 end-page: 3333 ident: br0210 article-title: Efficient approximation algorithms for multi-antennae largest weight data retrieval publication-title: IEEE Trans. Mob. Comput. – volume: 32 start-page: 299 year: 2004 end-page: 301 ident: br0340 article-title: Finding odd cycle transversals publication-title: Oper. Res. Lett. – volume: 138 start-page: 55 year: 2002 end-page: 86 ident: br0190 article-title: Fixed-parameter complexity in AI and non-monotonic reasoning publication-title: Artif. Intell. – volume: 74 start-page: 1188 year: 2008 end-page: 1198 ident: br0080 article-title: Improved algorithms for feedback vertex set problems publication-title: J. Comput. Syst. Sci. – volume: 657 start-page: 20 year: 2017 end-page: 27 ident: br0250 article-title: Improved kernel results for some FPT problems based on simple observations publication-title: Theor. Comput. Sci. – year: 2017 ident: br0160 article-title: Parameterized algorithms for edge biclique and related problems publication-title: Theor. Comput. Sci. – year: 1999 ident: br0140 article-title: Parameterized Complexity – volume: 12 start-page: 219 year: 2000 end-page: 234 ident: br0020 article-title: Randomized algorithms for the loop cutset problem publication-title: J. Artif. Intell. Res. – volume: vol. 9214 start-page: 178 year: 2015 end-page: 188 ident: br0100 article-title: Dealing with 4-variables by resolution: an improved MaxSAT algorithm publication-title: Proc. WADS 2015 – volume: 114 start-page: 556 year: 2014 end-page: 560 ident: br0240 article-title: Faster deterministic feedback vertex set publication-title: Inf. Process. Lett. – year: 2016 ident: br0170 article-title: Vertex cover structural parameterization revisited – start-page: 85 year: 1972 end-page: 103 ident: br0230 article-title: Reducibility among combinatorial problem publication-title: Complexity of Computer Computations – year: 2015 ident: br0110 article-title: Parameterized Algorithms – volume: 73 start-page: 63 year: 2015 end-page: 86 ident: br0060 article-title: On feedback vertex set: new measure and new structures publication-title: Algorithmica – volume: 83 start-page: 167 year: 1996 end-page: 188 ident: br0030 article-title: Optimization of pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem publication-title: Artif. Intell. – volume: vol. 9198 start-page: 133 year: 2015 end-page: 144 ident: br0330 article-title: Bivariate complexity analysis of almost forest deletion publication-title: Proc. COCOON 2015 – volume: 461 start-page: 65 year: 2012 end-page: 75 ident: br0280 article-title: On parameterized independent feedback vertex set publication-title: Theor. Comput. Sci. – start-page: 150 year: 2011 end-page: 159 ident: br0120 article-title: Solving connectivity problems parameterized by treewidth in single exponential time publication-title: Proc. FOCS 2011 – year: 1994 ident: br0350 article-title: Operating System Concepts – year: 2006 ident: br0310 article-title: Invitation to Fixed-Parameter Algorithms – volume: vol. 63 start-page: 7:1 year: 2017 end-page: 7:12 ident: br0050 article-title: A faster parameterized algorithm for pseudoforest deletion publication-title: Proc. IPEC 2016 – volume: 252 start-page: 187 year: 2017 end-page: 200 ident: br0260 article-title: Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree publication-title: Inf. Comput. – volume: 12 start-page: 219 year: 2000 ident: 10.1016/j.ipl.2018.03.016_br0020 article-title: Randomized algorithms for the loop cutset problem publication-title: J. Artif. Intell. Res. doi: 10.1613/jair.638 – volume: 208 start-page: 165 issue: 2 year: 2010 ident: 10.1016/j.ipl.2018.03.016_br0040 article-title: Parameterized computational complexity of Dodgson and Young elections publication-title: Inf. Comput. doi: 10.1016/j.ic.2009.10.001 – volume: 27 start-page: 290 issue: 1 year: 2013 ident: 10.1016/j.ipl.2018.03.016_br0130 article-title: Subset feedback vertex set is fixed-parameter tractable publication-title: SIAM J. Discrete Math. doi: 10.1137/110843071 – volume: 24 start-page: 131 issue: 2 year: 2012 ident: 10.1016/j.ipl.2018.03.016_br0290 article-title: FPT algorithms for connected feedback vertex set publication-title: J. Comb. Optim. doi: 10.1007/s10878-011-9394-2 – volume: 19 start-page: 387 issue: 4 year: 2014 ident: 10.1016/j.ipl.2018.03.016_br0220 article-title: Parameter ecology for feedback vertex set publication-title: Tsinghua Sci. Technol. doi: 10.1109/TST.2014.6867520 – start-page: 150 year: 2011 ident: 10.1016/j.ipl.2018.03.016_br0120 article-title: Solving connectivity problems parameterized by treewidth in single exponential time – ident: 10.1016/j.ipl.2018.03.016_br0170 – volume: 32 start-page: 299 issue: 4 year: 2004 ident: 10.1016/j.ipl.2018.03.016_br0340 article-title: Finding odd cycle transversals publication-title: Oper. Res. Lett. doi: 10.1016/j.orl.2003.10.009 – year: 2017 ident: 10.1016/j.ipl.2018.03.016_br0150 article-title: Dealing with several parameterized problems by random methods publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2017.09.024 – volume: 657 start-page: 11 year: 2017 ident: 10.1016/j.ipl.2018.03.016_br0270 article-title: Partition on trees with supply and demand: kernelization and algorithms publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2016.06.044 – volume: vol. 8287 start-page: 153 year: 2013 ident: 10.1016/j.ipl.2018.03.016_br0360 article-title: An improved exact algorithm for undirected feedback vertex set – volume: 12 start-page: 289 issue: 3 year: 1999 ident: 10.1016/j.ipl.2018.03.016_br0010 article-title: A 2-approximation algorithm for the undirected feedback vertex set problem publication-title: SIAM J. Discrete Math. doi: 10.1137/S0895480196305124 – volume: 252 start-page: 187 year: 2017 ident: 10.1016/j.ipl.2018.03.016_br0260 article-title: Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree publication-title: Inf. Comput. doi: 10.1016/j.ic.2016.11.003 – volume: 138 start-page: 55 year: 2002 ident: 10.1016/j.ipl.2018.03.016_br0190 article-title: Fixed-parameter complexity in AI and non-monotonic reasoning publication-title: Artif. Intell. doi: 10.1016/S0004-3702(02)00182-0 – volume: vol. 9235 start-page: 517 year: 2015 ident: 10.1016/j.ipl.2018.03.016_br0320 article-title: Generalized pseudoforest deletion: algorithms and uniform kernel – volume: 114 start-page: 556 issue: 10 year: 2014 ident: 10.1016/j.ipl.2018.03.016_br0240 article-title: Faster deterministic feedback vertex set publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2014.05.001 – volume: 16 start-page: 3320 issue: 12 year: 2017 ident: 10.1016/j.ipl.2018.03.016_br0210 article-title: Efficient approximation algorithms for multi-antennae largest weight data retrieval publication-title: IEEE Trans. Mob. Comput. doi: 10.1109/TMC.2017.2696009 – volume: vol. 4169 start-page: 184 year: 2006 ident: 10.1016/j.ipl.2018.03.016_br0180 article-title: Finding a minimum feedback vertex set in time O(1.7548n) – volume: 74 start-page: 1188 issue: 7 year: 2008 ident: 10.1016/j.ipl.2018.03.016_br0080 article-title: Improved algorithms for feedback vertex set problems publication-title: J. Comput. Syst. Sci. doi: 10.1016/j.jcss.2008.05.002 – year: 2009 ident: 10.1016/j.ipl.2018.03.016_br0300 – volume: vol. 9198 start-page: 133 year: 2015 ident: 10.1016/j.ipl.2018.03.016_br0330 article-title: Bivariate complexity analysis of almost forest deletion – volume: vol. 9214 start-page: 178 year: 2015 ident: 10.1016/j.ipl.2018.03.016_br0100 article-title: Dealing with 4-variables by resolution: an improved MaxSAT algorithm – year: 1999 ident: 10.1016/j.ipl.2018.03.016_br0140 – year: 2006 ident: 10.1016/j.ipl.2018.03.016_br0310 – volume: 76 start-page: 867 issue: 4 year: 2016 ident: 10.1016/j.ipl.2018.03.016_br0090 article-title: Approximating maximum agreement forest on multiple binary trees publication-title: Algorithmica doi: 10.1007/s00453-015-0087-6 – year: 1994 ident: 10.1016/j.ipl.2018.03.016_br0350 – year: 2017 ident: 10.1016/j.ipl.2018.03.016_br0160 article-title: Parameterized algorithms for edge biclique and related problems publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2017.09.027 – volume: vol. 63 start-page: 7:1 year: 2017 ident: 10.1016/j.ipl.2018.03.016_br0050 article-title: A faster parameterized algorithm for pseudoforest deletion – volume: 7 start-page: 83 issue: 1–2 year: 1995 ident: 10.1016/j.ipl.2018.03.016_br0070 article-title: An exact algorithm for selecting partial scan flip-flops publication-title: J. Electron. Test. doi: 10.1007/BF00993316 – year: 2015 ident: 10.1016/j.ipl.2018.03.016_br0110 – volume: 72 start-page: 1386 issue: 8 year: 2006 ident: 10.1016/j.ipl.2018.03.016_br0200 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 – volume: 461 start-page: 65 year: 2012 ident: 10.1016/j.ipl.2018.03.016_br0280 article-title: On parameterized independent feedback vertex set publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2012.02.012 – start-page: 85 year: 1972 ident: 10.1016/j.ipl.2018.03.016_br0230 article-title: Reducibility among combinatorial problem – volume: 83 start-page: 167 issue: 1 year: 1996 ident: 10.1016/j.ipl.2018.03.016_br0030 article-title: Optimization of pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem publication-title: Artif. Intell. doi: 10.1016/0004-3702(95)00004-6 – volume: 657 start-page: 20 year: 2017 ident: 10.1016/j.ipl.2018.03.016_br0250 article-title: Improved kernel results for some FPT problems based on simple observations publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2016.06.012 – volume: 73 start-page: 63 issue: 1 year: 2015 ident: 10.1016/j.ipl.2018.03.016_br0060 article-title: On feedback vertex set: new measure and new structures publication-title: Algorithmica doi: 10.1007/s00453-014-9904-6 |
| SSID | ssj0006437 |
| Score | 2.26968 |
| Snippet | Almost Forest Deletion problem (AFD) is a generalization of the Feedback Vertex Set problem, which decides whether there exist at most k vertices in a given... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 30 |
| SubjectTerms | Almost forest deletion Feedback vertex set Fixed-parameter algorithm Graph algorithms Iterative compression |
| Title | An improved FPT algorithm for Almost Forest Deletion problem |
| URI | https://dx.doi.org/10.1016/j.ipl.2018.03.016 |
| Volume | 136 |
| WOSCitedRecordID | wos000435045200008&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: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-6119 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0006437 issn: 0020-0190 databaseCode: AIEXJ dateStart: 19950113 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3NT9swFLcm2GGXfU9jA-TDTkNBSRzHtrRLxEADMcSkbustcu0UgkJStQH1z-f5K1TApm3SLqn1EqeV36_vPft9IfRB0YQlWivgwEREGYeRrISKaJIrqrVUxBbS_nHMTk74eCxOvQd_YdsJsLbly6WY_VdWAw2YbVJn_4Ldw0uBAGNgOlyB7XD9I8YXrUl9nHfXYEoenI52ZHPWzev-_NJGFBbNZbfod0xHTvj4XJna250N0zJ9ZVZNVZ-oFG6bdAJzrNDY_J_BEj92NQi-Xp1JrwOtXekkyLe66W6pP_3R9BEgclkPoNwL-SFA9qHC_hQi4UMMnD8au5ce41MFTNSb6we6WzkJy1kK-1UvJ4MIJqtC1DtqnDp2d-4JenfmcLFbz4z_KOG2Um1yp6i2VdPGHW0MWXiImOJFoK_XU0YFSPH14nB_fDQobuPDdBFB7lcHJ7gNB7zzRQ-bMSumyeg5eur3FLhwWHiBHlXtS_Qs9OvAXny_Qp-KFgdoYIAGHqCBgdXYQQM7aOAADeyh8Rp9P9gf7X2JfPeMSKWC9ZHQKubTTBAqNdFUTanOJxqs9zQ3Y5ozMk10TuHfqlUuQJiDpTglJMkrLic8J2_QWtu11VuEJSdAl5NYsTRjKpWwh5cx01rTTFR5uoHisBil8qXlTYeTpgwxhBclrF9p1q-MSQmUDfRxmDJzdVV-93AWVrj0hqEz-EqAw6-nvfu3ae_Rk1uEb6K1fn5VbaHH6rqvF_NtD5obM9SFBQ |
| linkProvider | Elsevier |
| 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+FPT+algorithm+for+Almost+Forest+Deletion+problem&rft.jtitle=Information+processing+letters&rft.au=Lin%2C+Mugang&rft.au=Feng%2C+Qilong&rft.au=Wang%2C+Jianxin&rft.au=Chen%2C+Jianer&rft.date=2018-08-01&rft.pub=Elsevier+B.V&rft.issn=0020-0190&rft.eissn=1872-6119&rft.volume=136&rft.spage=30&rft.epage=36&rft_id=info:doi/10.1016%2Fj.ipl.2018.03.016&rft.externalDocID=S0020019018300772 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-0190&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-0190&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-0190&client=summon |