On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms
We present a time algorithm finding a minimum feedback vertex set in an undirected graph on n vertices. We also prove that a graph on n vertices can contain at most 1.8638 n minimal feedback vertex sets and that there exist graphs having 105 n /10 ≈1.5926 n minimal feedback vertex sets.
Saved in:
| Published in: | Algorithmica Vol. 52; no. 2; pp. 293 - 307 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
Springer-Verlag
01.10.2008
|
| Subjects: | |
| ISSN: | 0178-4617, 1432-0541 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | We present a time
algorithm finding a minimum feedback vertex set in an undirected graph on
n
vertices. We also prove that a graph on
n
vertices can contain at most 1.8638
n
minimal feedback vertex sets and that there exist graphs having 105
n
/10
≈1.5926
n
minimal feedback vertex sets. |
|---|---|
| AbstractList | We present a time
algorithm finding a minimum feedback vertex set in an undirected graph on
n
vertices. We also prove that a graph on
n
vertices can contain at most 1.8638
n
minimal feedback vertex sets and that there exist graphs having 105
n
/10
≈1.5926
n
minimal feedback vertex sets. |
| Author | Razgon, Igor Fomin, Fedor V. Gaspers, Serge Pyatkin, Artem V. |
| Author_xml | – sequence: 1 givenname: Fedor V. surname: Fomin fullname: Fomin, Fedor V. organization: Department of Informatics, University of Bergen – sequence: 2 givenname: Serge surname: Gaspers fullname: Gaspers, Serge email: Serge.Gaspers@ii.uib.no organization: Department of Informatics, University of Bergen – sequence: 3 givenname: Artem V. surname: Pyatkin fullname: Pyatkin, Artem V. organization: Sobolev Institute of Mathematics, SB RAS – sequence: 4 givenname: Igor surname: Razgon fullname: Razgon, Igor organization: Computer Science Department, University College Cork |
| BookMark | eNp9kMtOwzAQRS1UJNrCB7DzDwTGr5iwq6oWkIqKxGMb2cmkTUkcZDtS-XtSyopFV3MXc65mzoSMXOeQkGsGNwxA3wYAqUQyxCRjiidwRsZMiiEoyUZkDEzfJTJl-oJMQtgBMK6zdExWa0fjFulz7eq2b-kSsbSm-KQf6CPu6StG-uI722B7Txd7U0RqXEkXrm_Rm1h3js6aTefruG3DJTmvTBPw6m9Oyfty8TZ_TFbrh6f5bJUUQsmYGEgtZBlPS8ZUlZbCoDZoUlEJIYXhyKuM2cxaBdJqqRTP0IIqZVlxbXglpkQfewvfheCxyos6_h4TvambnEF-kJIfpeSHeJCSw0Cyf-SXr1vjv08y_MiEYddt0Oe7rvduePAE9AN-23W2 |
| CitedBy_id | crossref_primary_10_1007_s00453_022_01031_w crossref_primary_10_1007_s00453_010_9418_9 crossref_primary_10_1007_s00453_012_9731_6 crossref_primary_10_1016_j_tcs_2012_12_021 crossref_primary_10_1109_TAC_2023_3269321 crossref_primary_10_3390_math12081215 crossref_primary_10_1007_s00453_010_9390_4 crossref_primary_10_1016_j_tcs_2014_05_001 crossref_primary_10_1088_1674_1056_ad4329 crossref_primary_10_1016_j_ejc_2012_07_023 crossref_primary_10_1016_j_jda_2013_09_005 crossref_primary_10_1002_jgt_21631 crossref_primary_10_1109_TNNLS_2022_3192563 crossref_primary_10_1007_s00453_011_9555_9 crossref_primary_10_1007_s00453_018_0431_8 crossref_primary_10_1016_j_amc_2022_127107 crossref_primary_10_1109_ACCESS_2020_3036916 crossref_primary_10_1016_j_jctb_2011_12_001 crossref_primary_10_1016_j_disc_2024_113910 crossref_primary_10_1111_tops_12211 crossref_primary_10_1364_JOCN_9_00A154 crossref_primary_10_1137_09077850X crossref_primary_10_1007_s00453_011_9575_5 crossref_primary_10_1007_s00453_015_0054_2 crossref_primary_10_1111_itor_13299 crossref_primary_10_1016_j_tcs_2014_11_006 crossref_primary_10_1016_j_jcss_2017_04_003 crossref_primary_10_1051_ita_2024015 crossref_primary_10_1109_TSP_2012_2195656 crossref_primary_10_1016_j_ejc_2017_07_015 crossref_primary_10_1016_j_tcs_2013_03_026 crossref_primary_10_1016_j_tcs_2014_03_031 crossref_primary_10_1007_s00453_012_9612_z crossref_primary_10_1038_s41598_023_33346_1 crossref_primary_10_1137_140964801 crossref_primary_10_1002_jgt_22179 crossref_primary_10_1109_TCYB_2024_3473945 crossref_primary_10_1007_s00453_014_9904_6 crossref_primary_10_1016_j_ic_2017_07_006 crossref_primary_10_1016_j_tcs_2016_03_026 crossref_primary_10_1007_s00453_010_9474_1 crossref_primary_10_1145_1552285_1552286 crossref_primary_10_1109_TCNS_2020_3041423 crossref_primary_10_1007_s00453_013_9759_2 crossref_primary_10_1007_s10878_014_9737_x crossref_primary_10_1016_j_ipl_2011_08_002 crossref_primary_10_1007_s10955_023_03210_7 |
| Cites_doi | 10.1023/A:1009736921890 10.1006/jagm.2000.1137 10.1016/j.orl.2004.03.002 10.1287/moor.27.2.361.328 10.1007/3-540-36478-1_17 10.1007/11847250_17 10.1016/S0166-218X(99)00180-8 10.1137/S0895480196305124 10.1137/S0097539796305109 10.1109/FOCS.2006.41 10.1145/1109557.1109560 10.1109/FOCS.2006.11 10.1002/jgt.20041 10.1016/S0167-6377(98)00021-2 10.1137/S0895480195291874 10.1007/BF02760024 10.1016/S0166-218X(00)00339-5 10.1016/0196-6774(86)90032-5 10.1007/3-540-61310-2_33 10.1007/11523468_16 10.1007/11560586_30 10.1007/11533719_87 10.1007/11602613_58 10.1007/978-1-4684-2001-2_9 10.1007/978-1-4612-0515-9 10.1007/11785293_17 10.1007/11534273_5 10.1007/978-1-4757-3023-4_4 10.1007/3-540-36136-7_22 |
| ContentType | Journal Article |
| Copyright | Springer Science+Business Media, LLC 2007 |
| Copyright_xml | – notice: Springer Science+Business Media, LLC 2007 |
| DBID | AAYXX CITATION |
| DOI | 10.1007/s00453-007-9152-0 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1432-0541 |
| EndPage | 307 |
| ExternalDocumentID | 10_1007_s00453_007_9152_0 |
| GroupedDBID | -4Z -59 -5G -BR -EM -Y2 -~C -~X .86 .DC .VR 06D 0R~ 0VY 199 1N0 1SB 203 23M 28- 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 78A 8TC 8UJ 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 ABDPE ABDZT ABECU ABFSI ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABLJU ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTAH ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AI. AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. BA0 BBWZM BDATZ BGNMA BSONS CAG COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP E.L EBLON EBS EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ H~9 I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV KOW LAS LLZTM M4Y MA- N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P9O PF- PT4 PT5 QOK QOS R4E R89 R9I RHV RIG RNI RNS ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TN5 TSG TSK TSV TUC U2A UG4 UOJIU UQL UTJUX UZXMN VC2 VFIZW VH1 VXZ W23 W48 WK8 YLTOR Z45 Z7X Z83 Z88 Z8R Z8W Z92 ZMTXR ZY4 ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION |
| ID | FETCH-LOGICAL-c354t-a06b09926d115f6d3ae7aea63f3343a2e2f91b9bb504b745529eb05d4df27a2f3 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 81 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000258717200011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0178-4617 |
| IngestDate | Tue Nov 18 22:13:00 EST 2025 Sat Nov 29 03:45:23 EST 2025 Fri Feb 21 02:43:07 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | Number of minimal feedback vertex sets Exact exponential algorithm Minimum feedback vertex set Maximum induced forest |
| Language | English |
| License | http://www.springer.com/tdm |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c354t-a06b09926d115f6d3ae7aea63f3343a2e2f91b9bb504b745529eb05d4df27a2f3 |
| PageCount | 15 |
| ParticipantIDs | crossref_citationtrail_10_1007_s00453_007_9152_0 crossref_primary_10_1007_s00453_007_9152_0 springer_journals_10_1007_s00453_007_9152_0 |
| PublicationCentury | 2000 |
| PublicationDate | 2008-10-01 |
| PublicationDateYYYYMMDD | 2008-10-01 |
| PublicationDate_xml | – month: 10 year: 2008 text: 2008-10-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Algorithmica |
| PublicationTitleAbbrev | Algorithmica |
| PublicationYear | 2008 |
| Publisher | Springer-Verlag |
| Publisher_xml | – name: Springer-Verlag |
| References | Fomin, Grandoni, Kratsch (CR16) 2005; 87 Raman, Saurabh, Subramanian (CR28) 2002 Festa, Pardalos, Resende (CR13) 1999 Schwikowski, Speckenmeyer (CR32) 2002; 117 Karp (CR22) 1972 Woeginger (CR33) 2003 Razgon (CR29) 2006 Björklund, Husfeldt (CR3) 2006 Byskov, Madsen, Skjernaa (CR6) 2005; 48 Funke, Reinelt (CR20) 1996 CR14 Moon, Moser (CR25) 1965; 3 CR30 Robson (CR31) 1986; 7 Bar-Yehuda, Geiger, Naor, Roth (CR2) 1998; 27 Dehne, Fellows, Langston, Rosamond, Stevens (CR10) 2005 Pardalos, Qian, Resende (CR26) 1999; 2 Bafna, Berman, Fujito (CR1) 1999; 12 Fomin, Grandoni, Pyatkin, Stepanov (CR17) 2005 Fomin, Grandoni, Kratsch (CR19) 2006 Guo, Niedermeier, Wernicke (CR21) 2005 Chudak, Goemans, Hochbaum, Williamson (CR9) 1998; 22 CR8 Cai, Deng, Zang (CR7) 2002; 27 Byskov (CR5) 2004; 32 Koivisto (CR24) 2006 Downey, Fellows (CR11) 1999 Even, Naor, Schieber, Zosin (CR12) 2000; 13 Brunetta, Maffioli, Trubian (CR4) 2000; 101 Fomin, Gaspers, Pyatkin (CR18) 2006 Raman, Saurabh, Sikdar (CR27) 2005 Fomin, Grandoni, Kratsch (CR15) 2005 Kleinberg, Kumar (CR23) 2001; 38 J. Guo (9152_CR21) 2005 G. Woeginger (9152_CR33) 2003 J.M. Byskov (9152_CR6) 2005; 48 F.V. Fomin (9152_CR19) 2006 I. Razgon (9152_CR29) 2006 9152_CR8 F.K.H.A. Dehne (9152_CR10) 2005 F.V. Fomin (9152_CR18) 2006 M. Koivisto (9152_CR24) 2006 R. Bar-Yehuda (9152_CR2) 1998; 27 A. Björklund (9152_CR3) 2006 J.M. Byskov (9152_CR5) 2004; 32 M.-C. Cai (9152_CR7) 2002; 27 F.A. Chudak (9152_CR9) 1998; 22 G. Even (9152_CR12) 2000; 13 M. Funke (9152_CR20) 1996 V. Raman (9152_CR27) 2005 F.V. Fomin (9152_CR15) 2005 J.W. Moon (9152_CR25) 1965; 3 F.V. Fomin (9152_CR16) 2005; 87 L. Brunetta (9152_CR4) 2000; 101 P.M. Pardalos (9152_CR26) 1999; 2 P. Festa (9152_CR13) 1999 R.M. Karp (9152_CR22) 1972 9152_CR14 V. Raman (9152_CR28) 2002 R.G. Downey (9152_CR11) 1999 9152_CR30 F.V. Fomin (9152_CR17) 2005 J. Kleinberg (9152_CR23) 2001; 38 V. Bafna (9152_CR1) 1999; 12 B. Schwikowski (9152_CR32) 2002; 117 J.M. Robson (9152_CR31) 1986; 7 |
| References_xml | – volume: 2 start-page: 399 year: 1999 end-page: 412 ident: CR26 article-title: A greedy randomized adaptive search procedure for the feedback vertex set problem publication-title: J. Comb. Optim. doi: 10.1023/A:1009736921890 – start-page: 160 year: 2006 end-page: 171 ident: CR29 article-title: Exact computation of maximum induced forest publication-title: Proceedings of the 10th Scandinavian Workshop on Algorithm Theory (SWAT 2006) – start-page: 445 year: 1996 end-page: 459 ident: CR20 article-title: A polyhedral approach to the feedback vertex set problem publication-title: Integer Programming and Combinatorial Optimization – start-page: 85 year: 1972 end-page: 103 ident: CR22 article-title: Reducibility among combinatorial problems publication-title: Complexity of Computer Computations – start-page: 209 year: 1999 end-page: 258 ident: CR13 article-title: Feedback set problems publication-title: Handbook of Combinatorial Optimization, Supplement vol. A – ident: CR14 – ident: CR30 – volume: 38 start-page: 25 year: 2001 end-page: 50 ident: CR23 article-title: Wavelength conversion in optical networks publication-title: J. Algorithms doi: 10.1006/jagm.2000.1137 – volume: 32 start-page: 547 year: 2004 end-page: 556 ident: CR5 article-title: Enumerating maximal independent sets with applications to graph colouring publication-title: Oper. Res. Lett. doi: 10.1016/j.orl.2004.03.002 – volume: 27 start-page: 361 year: 2002 end-page: 371 ident: CR7 article-title: A min-max theorem on feedback vertex sets publication-title: Math. Oper. Res. doi: 10.1287/moor.27.2.361.328 – start-page: 185 year: 2003 end-page: 207 ident: CR33 article-title: Exact algorithms for NP-hard problems: a survey publication-title: Combinatorial Optimization—Eureka, You Shrink! doi: 10.1007/3-540-36478-1_17 – start-page: 241 year: 2002 end-page: 248 ident: CR28 article-title: Faster fixed parameter tractable algorithms for undirected feedback vertex set publication-title: Proceedings of the 13th International Symposium on Algorithms and Computation (ISAAC 2002) – volume: 87 start-page: 47 year: 2005 end-page: 77 ident: CR16 article-title: Some new techniques in design and analysis of exact (exponential) algorithms publication-title: Bull. EATCS – ident: CR8 – start-page: 859 year: 2005 end-page: 869 ident: CR10 article-title: An (2 ) FPT algorithm for the undirected feedback vertex set problem publication-title: Proceedings of the 11th Annual International Conference on Computing and Combinatorics (COCOON 2005) – start-page: 184 year: 2006 end-page: 191 ident: CR18 article-title: Finding a minimum feedback vertex set in time (1.7548 ) publication-title: Proceedings of the 2nd International Workshop on Parameterized and Exact Computation (IWPEC 2006) doi: 10.1007/11847250_17 – volume: 101 start-page: 37 year: 2000 end-page: 51 ident: CR4 article-title: Solving the feedback vertex set problem on undirected graphs publication-title: Discrete Appl. Math. doi: 10.1016/S0166-218X(99)00180-8 – volume: 12 start-page: 289 year: 1999 end-page: 297 ident: CR1 article-title: A 2-approximation algorithm for the undirected feedback vertex set problem publication-title: SIAM J. Discrete Math. doi: 10.1137/S0895480196305124 – volume: 27 start-page: 942 year: 1998 end-page: 959 ident: CR2 article-title: Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and Bayesian inference publication-title: SIAM J. Comput. doi: 10.1137/S0097539796305109 – start-page: 575 year: 2006 end-page: 582 ident: CR3 article-title: Inclusion-exclusion algorithms for counting set partitions publication-title: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006) doi: 10.1109/FOCS.2006.41 – start-page: 36 year: 2005 end-page: 48 ident: CR21 article-title: Parameterized complexity of generalized vertex cover problems publication-title: Proceedings of the 9th International Workshop on Algorithms and Data Structures (WADS 2005) – start-page: 18 year: 2006 end-page: 25 ident: CR19 article-title: Measure and conquer: a simple (2 ) independent set algorithm publication-title: 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006) doi: 10.1145/1109557.1109560 – start-page: 583 year: 2006 end-page: 590 ident: CR24 article-title: An (2 ) algorithm for graph coloring and other partitioning problems via inclusion-exclusion publication-title: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006) doi: 10.1109/FOCS.2006.11 – volume: 48 start-page: 127 year: 2005 end-page: 132 ident: CR6 article-title: On the number of maximal bipartite subgraphs of a graph publication-title: J. Graph Theory doi: 10.1002/jgt.20041 – start-page: 573 year: 2005 end-page: 582 ident: CR17 article-title: Bounding the number of minimal dominating sets: a measure and conquer approach publication-title: Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005) – start-page: 375 year: 2005 end-page: 389 ident: CR27 article-title: Improved exact exponential algorithms for vertex bipartization and other problems publication-title: Proceedings of the 9th Italian Conference on Theoretical Computer Science (ICTCS 2005) – volume: 22 start-page: 111 year: 1998 end-page: 118 ident: CR9 article-title: A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs publication-title: Oper. Res. Lett. doi: 10.1016/S0167-6377(98)00021-2 – year: 1999 ident: CR11 publication-title: Parameterized Complexity – start-page: 191 year: 2005 end-page: 203 ident: CR15 article-title: Measure and conquer: domination—a case study publication-title: Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005) – volume: 13 start-page: 255 year: 2000 end-page: 267 ident: CR12 article-title: Approximating minimum subset feedback sets in undirected graphs with applications publication-title: SIAM J. Discrete Math. doi: 10.1137/S0895480195291874 – volume: 3 start-page: 23 year: 1965 end-page: 28 ident: CR25 article-title: On cliques in graphs publication-title: Isr. J. Math. doi: 10.1007/BF02760024 – volume: 117 start-page: 253 year: 2002 end-page: 265 ident: CR32 article-title: On enumerating all minimal solutions of feedback problems publication-title: Discrete Appl. Math. doi: 10.1016/S0166-218X(00)00339-5 – volume: 7 start-page: 425 year: 1986 end-page: 440 ident: CR31 article-title: Algorithms for maximum independent sets publication-title: J. Algorithms doi: 10.1016/0196-6774(86)90032-5 – start-page: 575 volume-title: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006) year: 2006 ident: 9152_CR3 doi: 10.1109/FOCS.2006.41 – start-page: 445 volume-title: Integer Programming and Combinatorial Optimization year: 1996 ident: 9152_CR20 doi: 10.1007/3-540-61310-2_33 – volume: 12 start-page: 289 year: 1999 ident: 9152_CR1 publication-title: SIAM J. Discrete Math. doi: 10.1137/S0895480196305124 – ident: 9152_CR30 – volume: 27 start-page: 942 year: 1998 ident: 9152_CR2 publication-title: SIAM J. Comput. doi: 10.1137/S0097539796305109 – start-page: 583 volume-title: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006) year: 2006 ident: 9152_CR24 doi: 10.1109/FOCS.2006.11 – volume: 38 start-page: 25 year: 2001 ident: 9152_CR23 publication-title: J. Algorithms doi: 10.1006/jagm.2000.1137 – start-page: 191 volume-title: Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005) year: 2005 ident: 9152_CR15 doi: 10.1007/11523468_16 – start-page: 18 volume-title: 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006) year: 2006 ident: 9152_CR19 – start-page: 375 volume-title: Proceedings of the 9th Italian Conference on Theoretical Computer Science (ICTCS 2005) year: 2005 ident: 9152_CR27 doi: 10.1007/11560586_30 – start-page: 859 volume-title: Proceedings of the 11th Annual International Conference on Computing and Combinatorics (COCOON 2005) year: 2005 ident: 9152_CR10 doi: 10.1007/11533719_87 – start-page: 573 volume-title: Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005) year: 2005 ident: 9152_CR17 doi: 10.1007/11602613_58 – ident: 9152_CR8 – volume: 2 start-page: 399 year: 1999 ident: 9152_CR26 publication-title: J. Comb. Optim. doi: 10.1023/A:1009736921890 – volume: 48 start-page: 127 year: 2005 ident: 9152_CR6 publication-title: J. Graph Theory doi: 10.1002/jgt.20041 – volume: 22 start-page: 111 year: 1998 ident: 9152_CR9 publication-title: Oper. Res. Lett. doi: 10.1016/S0167-6377(98)00021-2 – volume: 13 start-page: 255 year: 2000 ident: 9152_CR12 publication-title: SIAM J. Discrete Math. doi: 10.1137/S0895480195291874 – start-page: 85 volume-title: Complexity of Computer Computations year: 1972 ident: 9152_CR22 doi: 10.1007/978-1-4684-2001-2_9 – ident: 9152_CR14 – volume: 7 start-page: 425 year: 1986 ident: 9152_CR31 publication-title: J. Algorithms doi: 10.1016/0196-6774(86)90032-5 – volume: 101 start-page: 37 year: 2000 ident: 9152_CR4 publication-title: Discrete Appl. Math. doi: 10.1016/S0166-218X(99)00180-8 – start-page: 184 volume-title: Proceedings of the 2nd International Workshop on Parameterized and Exact Computation (IWPEC 2006) year: 2006 ident: 9152_CR18 doi: 10.1007/11847250_17 – volume: 27 start-page: 361 year: 2002 ident: 9152_CR7 publication-title: Math. Oper. Res. doi: 10.1287/moor.27.2.361.328 – volume-title: Parameterized Complexity year: 1999 ident: 9152_CR11 doi: 10.1007/978-1-4612-0515-9 – volume: 32 start-page: 547 year: 2004 ident: 9152_CR5 publication-title: Oper. Res. Lett. doi: 10.1016/j.orl.2004.03.002 – volume: 87 start-page: 47 year: 2005 ident: 9152_CR16 publication-title: Bull. EATCS – start-page: 185 volume-title: Combinatorial Optimization—Eureka, You Shrink! year: 2003 ident: 9152_CR33 doi: 10.1007/3-540-36478-1_17 – volume: 117 start-page: 253 year: 2002 ident: 9152_CR32 publication-title: Discrete Appl. Math. doi: 10.1016/S0166-218X(00)00339-5 – start-page: 160 volume-title: Proceedings of the 10th Scandinavian Workshop on Algorithm Theory (SWAT 2006) year: 2006 ident: 9152_CR29 doi: 10.1007/11785293_17 – start-page: 36 volume-title: Proceedings of the 9th International Workshop on Algorithms and Data Structures (WADS 2005) year: 2005 ident: 9152_CR21 doi: 10.1007/11534273_5 – start-page: 209 volume-title: Handbook of Combinatorial Optimization, Supplement vol. A year: 1999 ident: 9152_CR13 doi: 10.1007/978-1-4757-3023-4_4 – start-page: 241 volume-title: Proceedings of the 13th International Symposium on Algorithms and Computation (ISAAC 2002) year: 2002 ident: 9152_CR28 doi: 10.1007/3-540-36136-7_22 – volume: 3 start-page: 23 year: 1965 ident: 9152_CR25 publication-title: Isr. J. Math. doi: 10.1007/BF02760024 |
| SSID | ssj0012796 |
| Score | 2.1744022 |
| Snippet | We present a time
algorithm finding a minimum feedback vertex set in an undirected graph on
n
vertices. We also prove that a graph on
n
vertices can contain at... |
| SourceID | crossref springer |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 293 |
| SubjectTerms | Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Mathematics of Computing Theory of Computation |
| Title | On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms |
| URI | https://link.springer.com/article/10.1007/s00453-007-9152-0 |
| Volume | 52 |
| WOSCitedRecordID | wos000258717200011&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: 1432-0541 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0012796 issn: 0178-4617 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/eLvHCXMwnV1LS8NAEF5EPXixPrG-2IMnZSHd3WSz3oq0eKi1WC29hX1Fg20qTSr9-e6mSaCggt5ymIQws5Pv28zOfABc-ZoIwUKNgjAwiDItkFDEIE5EbOm9T7gsGoV7rN8Px2M-KPu4s-q0e1WSLL7UdbObYx8EuV9r3IIOsvv0LYt2ocvGp-GoLh1gVohyOdl5RC0-V6XM7x6xDkbrldACYLqNf73aHtgt-SRsrxbAPtgw6QFoVFoNsEzdQ9B7TKHlevAhSZPpYgq7FrWkUO9wZOa5WcKhyeFgJS5zCztLoXIoUg07qevPLKIH25PX2TzJ36bZEXjpdp7v7lGppIAU8WmOhBdISwVxoC0BjAMbH8OEEQGJCaFEYINj3pJcSt-jklHfx9xIz9dUx5gJHJNjsJnOUnMCIJZSxtxtY0JKNROSGiK9QFOFdayNagKvcmmkyjHjTu1iEtUDkgtvRe7SeSvymuC6vuVjNWPjN-ObKgZRmW7Zz9anf7I-Azu4GnfbOgeb-XxhLsC2-syTbH5ZLLMvwrnL4Q |
| linkProvider | Springer Nature |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1bS8MwFA4yBX1xXnFe8-CTEuiS9ObbkI2J3Rxujr2VpEm1uHXSdrKfb9K1hYEK-taH0xLOSfp9yck5HwDXpiCM2Y5AlmNJRG3BEAuIRC5hoaL3JnF5Xijs2f2-M5m4g6KOOy1vu5cpyfxPXRW7afZBkD5acxXoILVP36QKsPQ9vufhuEodYDsX5dKy84gqfC5Tmd99Yh2M1jOhOcB06v8a2h7YLfgkbK0mwD7YkPEBqJdaDbBYuofAe4qh4nqwF8XRbDGDHYVanAXvcCyTTC7hUGZwsBKXuYPtJQsyyGIB27Guz8yjB1vT13kSZW-z9Ai8dNqj-y4qlBRQQEyaIWZYXFFBbAlFAENLxUfaTDKLhIRQwrDEodvkLuemQblNTRO7khumoCLENsMhOQa1eB7LEwAx5zx09TbGoVTYjFNJuGEJGmARChk0gFG61A-KNuNa7WLqVw2Sc2_5-lF7yzca4KZ65WPVY-M349syBn6x3NKfrU__ZH0Ftrujnud7D_3HM7CDy9a3zXNQy5KFvABbwWcWpcllPuW-AFtWzsU |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LSwMxEA5SRbxYn1ifOXhSQrdJ9uWtaItirYVq6W1JNokuttvSbqU_32RfUFBBvO1hdllmEr5vMpn5ALi0BWHM9QRyPEci6gqGWEgk8glTmt7bxOdpo3DH7Xa94dDv5Tqn8-K2e1GSzHoazJSmOKlPhaqXjW-GiRBkjtl8DUBI5-zr1GgGmXS9PyjLCNhNBbqMBD2iGquLsuZ3n1gFptWqaAo27eq_f3MHbOc8EzazhbEL1mS8B6qFhgPMt_Q-6DzHUHNA-BTF0Xgxhm2NZpyFH3AgZ4lcwr5MYC8TnbmBrSULE8hiAVux6dtMowqbo7fJLErex_MD8Npuvdzeo1xhAYXEpglilsM1RcSO0MRQOTpu0mWSOUQRQgnDEiu_wX3ObYtyl9o29iW3bEGFwi7DihyCSjyJ5RGAmHOufJPeeJQKl3EqCbccQUMslJBhDViFe4MwHz9uVDBGQTk4OfVWYB6NtwKrBq7KV6bZ7I3fjK-LeAT5Npz_bH38J-sLsNm7awedh-7jCdjCxUTcximoJLOFPAMb4WcSzWfn6er7AgPm16k |
| 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=On+the+Minimum+Feedback+Vertex+Set+Problem%3A+Exact+and+Enumeration+Algorithms&rft.jtitle=Algorithmica&rft.au=Fomin%2C+Fedor+V.&rft.au=Gaspers%2C+Serge&rft.au=Pyatkin%2C+Artem+V.&rft.au=Razgon%2C+Igor&rft.date=2008-10-01&rft.issn=0178-4617&rft.eissn=1432-0541&rft.volume=52&rft.issue=2&rft.spage=293&rft.epage=307&rft_id=info:doi/10.1007%2Fs00453-007-9152-0&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s00453_007_9152_0 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0178-4617&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0178-4617&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0178-4617&client=summon |