An improved parameterized algorithm for the independent feedback vertex set problem
In this paper, we develop a new parameterized algorithm for the Independent Feedback Vertex Set problem. Given a graph G=(V,E), the goal of the problem is to determine whether there exists a vertex subset F⊆V such that V−F induces a forest in G and F is an independent set. We show that there exists...
Gespeichert in:
| Veröffentlicht in: | Theoretical computer science Jg. 535; S. 25 - 30 |
|---|---|
| 1. Verfasser: | |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier B.V
22.05.2014
|
| Schlagworte: | |
| ISSN: | 0304-3975, 1879-2294 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | In this paper, we develop a new parameterized algorithm for the Independent Feedback Vertex Set problem. Given a graph G=(V,E), the goal of the problem is to determine whether there exists a vertex subset F⊆V such that V−F induces a forest in G and F is an independent set. We show that there exists a parameterized algorithm that can determine whether a graph contains an IFVS of size k or not in time O(4kn2). To our best knowledge, this result improves the known upper bound for this problem, which is O(5knO(1)). |
|---|---|
| AbstractList | In this paper, we develop a new parameterized algorithm for the Independent Feedback Vertex Set problem. Given a graph G=(V,E), the goal of the problem is to determine whether there exists a vertex subset F⊆V such that V−F induces a forest in G and F is an independent set. We show that there exists a parameterized algorithm that can determine whether a graph contains an IFVS of size k or not in time O(4kn2). To our best knowledge, this result improves the known upper bound for this problem, which is O(5knO(1)). |
| Author | Song, Yinglei |
| Author_xml | – sequence: 1 givenname: Yinglei surname: Song fullname: Song, Yinglei email: yingleisong@gmail.com organization: School of Computer Science and Engineering, Jiangsu University of Science and Technology, Zhenjiang, Jiangsu 212003, China |
| BookMark | eNp9kE1LAzEQhoNUsK3-AG_5A7smm4_t4qkUv6DgQT2HbDJrU3ezSxKK-uuN1JOHDsMMw8zzwrwLNPOjB4SuKSkpofJmXyYTy4pQXhKWk56hOV3VTVFVDZ-hOWGEF6ypxQVaxLgnOUQt5-hl7bEbpjAewOJJBz1AguC-86T79zG4tBtwNwacdoCdtzBBLj7hDsC22nzgA4QEnzhCwlmm7WG4ROed7iNc_fUleru_e908Ftvnh6fNelsYzlgqqGmskIYKUdXQdWLVNpVeacOAc8rbWlImQduONrZiQhILOl8KW-edsBLYEtVHXRPGGAN0yrikkxt9Ctr1ihL1643aq-yN-vVGEZaTZpL-I6fgBh2-TjK3RwbySwcHQUXjwBuwLoBJyo7uBP0DZLOALg |
| CitedBy_id | crossref_primary_10_4018_IJDWM_2018100102 crossref_primary_10_1051_matecconf_20152806003 crossref_primary_10_1093_comjnl_bxv043 |
| Cites_doi | 10.1142/S0129054194000049 10.1016/j.jcss.2008.05.002 10.1007/s00453-007-9133-3 10.1016/j.orl.2003.10.009 10.1145/1159892.1159898 10.1007/s00453-007-9152-0 10.1016/j.tcs.2012.02.012 10.1016/j.jcss.2006.02.001 10.1016/j.jda.2009.08.001 10.1007/s00224-007-1309-3 |
| ContentType | Journal Article |
| Copyright | 2014 Elsevier B.V. |
| Copyright_xml | – notice: 2014 Elsevier B.V. |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.tcs.2014.03.031 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1879-2294 |
| EndPage | 30 |
| ExternalDocumentID | 10_1016_j_tcs_2014_03_031 S0304397514002539 |
| GrantInformation_xml | – fundername: Jiangsu University of Science and Technology grantid: 635301202 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 4.4 457 4G. 5VS 6I. 7-5 71M 8P~ 9JN AABNK AACTN AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABAOU ABBOA ABJNI ABMAC ABVKL ABXDB ABYKQ ACAZW ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE AEBSH AEKER AENEX AEXQZ AFKWA AFTJW AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR AXJTR BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A NCXOZ O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 RIG ROL RPZ SCC SDF SDG SES SPC SPCBC SSV SSW SSZ T5K TN5 WH7 YNT ZMT ~G- 29Q 9DU AAEDT AAQXK AATTM AAXKI AAYWO AAYXX ABDPE ABEFU ABFNM ABWVN ACLOT ACNNM ACRPL ACVFH ADCNI ADMUD ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGHFR AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FGOYB G-2 HZ~ R2- SEW TAE WUQ ZY4 ~HD |
| ID | FETCH-LOGICAL-c433t-1c9d56c15527eff58b92a8ac3e4414b76136eadf19d23560dea5275d74b75d6e3 |
| ISICitedReferencesCount | 11 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000336354100003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0304-3975 |
| IngestDate | Tue Nov 18 22:38:34 EST 2025 Sat Nov 29 05:15:16 EST 2025 Fri Feb 23 02:30:24 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Independent feedback vertex set Parameterized algorithm Dynamic programming |
| Language | English |
| License | http://www.elsevier.com/open-access/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c433t-1c9d56c15527eff58b92a8ac3e4414b76136eadf19d23560dea5275d74b75d6e3 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.tcs.2014.03.031 |
| PageCount | 6 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_tcs_2014_03_031 crossref_primary_10_1016_j_tcs_2014_03_031 elsevier_sciencedirect_doi_10_1016_j_tcs_2014_03_031 |
| PublicationCentury | 2000 |
| PublicationDate | 2014-05-22 |
| PublicationDateYYYYMMDD | 2014-05-22 |
| PublicationDate_xml | – month: 05 year: 2014 text: 2014-05-22 day: 22 |
| PublicationDecade | 2010 |
| PublicationTitle | Theoretical computer science |
| PublicationYear | 2014 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Guo, Niedermeier, Wernicke (br0110) 2007; 41 Niedermeier (br0180) 2006 Razgon (br0210) 2006 Cygan, Nederlof, Pilipczuk, Pilipczuk, van Rooij, Wojtaszczyk (br0040) 2011 Guo, Gramm, Hüffner, Niedermeier, Wernicke (br0120) 2006; 72 Downey, Fellows (br0080) 1999 Dom, Guo, Hüffner, Niedermeier, Trub (br0060) 2010; 8 Molina, Ullman, Widom (br0170) 2009 Silberschatz, Galvin, Gagne (br0230) 2012 Chen, Fomin, Liu, Lu, Villanger (br0030) 2008; 74 Dehne, Fellows, Langston, Rosamond, Stevens (br0050) 2005 Karp (br0140) 1972 Bodlaender (br0010) 1994; 5 Fomin, Gaspers, Saurabh, Stepanov (br0100) 2009; 54 Reed, Smith, Vetta (br0220) 2004; 32 Cao, Chen, Liu (br0020) 2010 Misra, Philip, Raman, Saurabh (br0160) 2012; 461 Raman, Saurabh, Subramanian (br0190) 2006; 2 Fomin, Gaspers, Pyatkin, Razgon (br0090) 2008; 52 Raman, Saurabh, Subramanian (br0200) 2002 Downey, Fellows (br0070) 1992 Kanj, Pelsmajer, Schaefer (br0130) 2004 Kociumaka, Pilipczuk (br0150) Raman (10.1016/j.tcs.2014.03.031_br0200) 2002 Dom (10.1016/j.tcs.2014.03.031_br0060) 2010; 8 Guo (10.1016/j.tcs.2014.03.031_br0120) 2006; 72 Kanj (10.1016/j.tcs.2014.03.031_br0130) 2004 Raman (10.1016/j.tcs.2014.03.031_br0190) 2006; 2 Fomin (10.1016/j.tcs.2014.03.031_br0100) 2009; 54 Downey (10.1016/j.tcs.2014.03.031_br0080) 1999 Silberschatz (10.1016/j.tcs.2014.03.031_br0230) 2012 Cygan (10.1016/j.tcs.2014.03.031_br0040) 2011 Reed (10.1016/j.tcs.2014.03.031_br0220) 2004; 32 Razgon (10.1016/j.tcs.2014.03.031_br0210) 2006 Downey (10.1016/j.tcs.2014.03.031_br0070) 1992 Misra (10.1016/j.tcs.2014.03.031_br0160) 2012; 461 Molina (10.1016/j.tcs.2014.03.031_br0170) 2009 Dehne (10.1016/j.tcs.2014.03.031_br0050) 2005 Karp (10.1016/j.tcs.2014.03.031_br0140) 1972 Niedermeier (10.1016/j.tcs.2014.03.031_br0180) 2006 Cao (10.1016/j.tcs.2014.03.031_br0020) 2010 Fomin (10.1016/j.tcs.2014.03.031_br0090) 2008; 52 Kociumaka (10.1016/j.tcs.2014.03.031_br0150) Bodlaender (10.1016/j.tcs.2014.03.031_br0010) 1994; 5 Guo (10.1016/j.tcs.2014.03.031_br0110) 2007; 41 Chen (10.1016/j.tcs.2014.03.031_br0030) 2008; 74 |
| References_xml | – start-page: 234 year: 2004 end-page: 247 ident: br0130 article-title: Parameterized algorithms for feedback vertex set publication-title: Proceedings of 2004 International Workshop on Parameterized and Exact Computation – volume: 54 start-page: 181 year: 2009 end-page: 207 ident: br0100 article-title: On two techniques of combining branching and treewidth publication-title: Algorithmica – start-page: 150 year: 2011 end-page: 159 ident: br0040 article-title: Solving connectivity problems parameterized by treewidth in single exponential time publication-title: Proceedings of the 52nd Annual Symposium on Foundations of Computer Science – volume: 32 start-page: 299 year: 2004 end-page: 301 ident: br0220 article-title: Finding odd cycle transversals publication-title: Oper. Res. Lett. – start-page: 93 year: 2010 end-page: 104 ident: br0020 article-title: On feedback vertex set new measure and new structures publication-title: SWAT 2010 – year: 1999 ident: br0080 article-title: Parameterized Complexity – volume: 2 start-page: 403 year: 2006 end-page: 415 ident: br0190 article-title: Faster fixed parameter tractable algorithms for undirected feedback vertex set publication-title: ACM Trans. Algorithms – start-page: 160 year: 2006 end-page: 171 ident: br0210 article-title: Exact computation of maximum induced forest publication-title: Proceedings of the 10th Scandinavian Workshop on Algorithm Theory – start-page: 191 year: 1992 end-page: 225 ident: br0070 article-title: Fixed parameter tractability and completeness publication-title: Complexity Theory: Current Research – volume: 52 start-page: 293 year: 2008 end-page: 307 ident: br0090 article-title: On the minimum feedback vertex set problem: exact and enumeration algorithms publication-title: Algorithmica – volume: 5 start-page: 59 year: 1994 end-page: 68 ident: br0010 article-title: On disjoint cycles publication-title: Internat. J. Found. Comput. Sci. – volume: 74 start-page: 1188 year: 2008 end-page: 1198 ident: br0030 article-title: Improved algorithms for feedback vertex set problems publication-title: J. Comput. System Sci. – start-page: 859 year: 2005 end-page: 869 ident: br0050 article-title: An publication-title: Proceedings of the 11th Annual International Conference on Computing and Combinatorics – volume: 461 start-page: 65 year: 2012 end-page: 75 ident: br0160 article-title: On parameterized independent feedback vertex set publication-title: Theoret. Comput. Sci. – year: 2012 ident: br0230 article-title: Operating System Concepts – start-page: 85 year: 1972 end-page: 103 ident: br0140 article-title: Reducibility among combinatorial problems publication-title: Complexity of Computer Computations – year: 2009 ident: br0170 article-title: Database Systems: The Complete Book – volume: 72 start-page: 1386 year: 2006 end-page: 1396 ident: br0120 article-title: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization publication-title: J. Comput. System Sci. – year: 2006 ident: br0180 article-title: Invitation to Fixed-Parameter Algorithms – start-page: 241 year: 2002 end-page: 248 ident: br0200 article-title: Faster fixed parameter tractable algorithms for finding feedback vertex set publication-title: Proceedings of the 13th International Symposium on Algorithms and Computation – volume: 8 start-page: 76 year: 2010 end-page: 86 ident: br0060 article-title: Fixed-parameter tractability results for feedback set problems in tournaments publication-title: J. Discrete Algorithms – volume: 41 start-page: 501 year: 2007 end-page: 520 ident: br0110 article-title: Parameterized complexity of vertex cover variants publication-title: Theory Comput. Syst. – ident: br0150 article-title: Faster deterministic feedback vertex set – start-page: 93 year: 2010 ident: 10.1016/j.tcs.2014.03.031_br0020 article-title: On feedback vertex set new measure and new structures – year: 2009 ident: 10.1016/j.tcs.2014.03.031_br0170 – volume: 5 start-page: 59 issue: 1 year: 1994 ident: 10.1016/j.tcs.2014.03.031_br0010 article-title: On disjoint cycles publication-title: Internat. J. Found. Comput. Sci. doi: 10.1142/S0129054194000049 – volume: 74 start-page: 1188 issue: 7 year: 2008 ident: 10.1016/j.tcs.2014.03.031_br0030 article-title: Improved algorithms for feedback vertex set problems publication-title: J. Comput. System Sci. doi: 10.1016/j.jcss.2008.05.002 – year: 1999 ident: 10.1016/j.tcs.2014.03.031_br0080 – year: 2006 ident: 10.1016/j.tcs.2014.03.031_br0180 – start-page: 234 year: 2004 ident: 10.1016/j.tcs.2014.03.031_br0130 article-title: Parameterized algorithms for feedback vertex set – volume: 54 start-page: 181 issue: 2 year: 2009 ident: 10.1016/j.tcs.2014.03.031_br0100 article-title: On two techniques of combining branching and treewidth publication-title: Algorithmica doi: 10.1007/s00453-007-9133-3 – start-page: 150 year: 2011 ident: 10.1016/j.tcs.2014.03.031_br0040 article-title: Solving connectivity problems parameterized by treewidth in single exponential time – start-page: 160 year: 2006 ident: 10.1016/j.tcs.2014.03.031_br0210 article-title: Exact computation of maximum induced forest – start-page: 191 year: 1992 ident: 10.1016/j.tcs.2014.03.031_br0070 article-title: Fixed parameter tractability and completeness – volume: 32 start-page: 299 issue: 4 year: 2004 ident: 10.1016/j.tcs.2014.03.031_br0220 article-title: Finding odd cycle transversals publication-title: Oper. Res. Lett. doi: 10.1016/j.orl.2003.10.009 – volume: 2 start-page: 403 issue: 3 year: 2006 ident: 10.1016/j.tcs.2014.03.031_br0190 article-title: Faster fixed parameter tractable algorithms for undirected feedback vertex set publication-title: ACM Trans. Algorithms doi: 10.1145/1159892.1159898 – start-page: 241 year: 2002 ident: 10.1016/j.tcs.2014.03.031_br0200 article-title: Faster fixed parameter tractable algorithms for finding feedback vertex set – volume: 52 start-page: 293 issue: 2 year: 2008 ident: 10.1016/j.tcs.2014.03.031_br0090 article-title: On the minimum feedback vertex set problem: exact and enumeration algorithms publication-title: Algorithmica doi: 10.1007/s00453-007-9152-0 – ident: 10.1016/j.tcs.2014.03.031_br0150 – volume: 461 start-page: 65 issue: 23 year: 2012 ident: 10.1016/j.tcs.2014.03.031_br0160 article-title: On parameterized independent feedback vertex set publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2012.02.012 – volume: 72 start-page: 1386 issue: 8 year: 2006 ident: 10.1016/j.tcs.2014.03.031_br0120 article-title: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization publication-title: J. Comput. System Sci. doi: 10.1016/j.jcss.2006.02.001 – volume: 8 start-page: 76 issue: 1 year: 2010 ident: 10.1016/j.tcs.2014.03.031_br0060 article-title: Fixed-parameter tractability results for feedback set problems in tournaments publication-title: J. Discrete Algorithms doi: 10.1016/j.jda.2009.08.001 – year: 2012 ident: 10.1016/j.tcs.2014.03.031_br0230 – volume: 41 start-page: 501 issue: 3 year: 2007 ident: 10.1016/j.tcs.2014.03.031_br0110 article-title: Parameterized complexity of vertex cover variants publication-title: Theory Comput. Syst. doi: 10.1007/s00224-007-1309-3 – start-page: 85 year: 1972 ident: 10.1016/j.tcs.2014.03.031_br0140 article-title: Reducibility among combinatorial problems – start-page: 859 year: 2005 ident: 10.1016/j.tcs.2014.03.031_br0050 article-title: An O(2O(k)n3) algorithm for the undirected feedback vertex set problem |
| SSID | ssj0000576 |
| Score | 2.1440647 |
| Snippet | In this paper, we develop a new parameterized algorithm for the Independent Feedback Vertex Set problem. Given a graph G=(V,E), the goal of the problem is to... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 25 |
| SubjectTerms | Dynamic programming Independent feedback vertex set Parameterized algorithm |
| Title | An improved parameterized algorithm for the independent feedback vertex set problem |
| URI | https://dx.doi.org/10.1016/j.tcs.2014.03.031 |
| Volume | 535 |
| WOSCitedRecordID | wos000336354100003&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: 1879-2294 dateEnd: 20180131 omitProxy: false ssIdentifier: ssj0000576 issn: 0304-3975 databaseCode: AIEXJ dateStart: 19950109 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bb9MwFLZKxwM8cBkgxk1-4IkoUxLbcfyEKjQESExIK1J5ihxfWEaXTm2oKn49x7WTZgwQICFFUZvmNJY_55zP9rkg9JxKq61ObJxnVseUV1UsdKZjYAoUDFau4dgWm-DHx8VsJj6MRi-7WJj1nDdNsdmIi_8KNVwDsF3o7F_A3f8pXIDPADqcAXY4_xHwk8aFPi4Xa6CSLrH3uXN4qb_BNzn_vFjW7el571tY90Vw28iCHauk-hK5Cs1mE61MG4VyM0MGOx1EPqpQEiIKdrRfrgl-vp_ALs5NPVxZSKnbFM9289CrIS8-zMptpQhf7uTQeK1ZcAGSvlpxp1YZYUPFyAYm1u_EXFHefh3h7LBVLo96SrfZZ4ONuJwT-8S1wjUCpodA2oi4hvYyzkQxRnuTt0ezdztjzLjfrg6t7ja2ty5-Pzzo59RkQDemd9CtME_AE4_vXTQyzT663dXgwEEl76Ob7_u8u6t76GTS4A58fAl83IOPAXwMMngAPu7Axx58DODjAP599PH10fTVmziUzYgVJaSNUyU0y9U2t56xlhWVyGQhFTFAfWnFgcDloD9sCi8lAcKrjYQ7mebwG9O5IQ_QuFk05iHCheQiSWQmkyqjRWIFZUqQRBJbZAqecICSrsdKFXLKu9Im87JzHjwroZNL18llQuBID9CLXuTCJ1T53c20g6EMI9kzvRLGzK_FHv2b2GN0Y_caPEHjdvnVPEXX1bqtV8tnYWR9B19PhgQ |
| 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+parameterized+algorithm+for+the+independent+feedback+vertex+set+problem&rft.jtitle=Theoretical+computer+science&rft.au=Song%2C+Yinglei&rft.date=2014-05-22&rft.pub=Elsevier+B.V&rft.issn=0304-3975&rft.eissn=1879-2294&rft.volume=535&rft.spage=25&rft.epage=30&rft_id=info:doi/10.1016%2Fj.tcs.2014.03.031&rft.externalDocID=S0304397514002539 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon |