R. Belmonte
Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set
Belmonte, R.; Hof, van 't P.; Kaminski, M.; Paulusma, D.
Authors
Contributors
Ersébet Csuhaj-Varjú
Editor
Martin Dietzfelbinger
Editor
Zoltán Ésik
Editor
Abstract
Let fvs(G) and cfvs(G) denote the cardinalities of a minimum feedback vertex set and a minimum connected feedback vertex set of a graph G, respectively. For a graph class G, the price of connectivity for feedback vertex set (poc-fvs) for G is defined as the maximum ratio cfvs(G)/fvs(G) over all connected graphs G in G. It is known that the poc-fvs for general graphs is unbounded. We study the poc-fvs for graph classes defined by a finite family H of forbidden induced subgraphs. We characterize exactly those finite families H for which the poc-fvs for H-free graphs is bounded by a constant. Prior to our work, such a result was only known for the case where |H|=1.
Citation
Belmonte, R., Hof, V. '. P., Kaminski, M., & Paulusma, D. (2014). Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set. In E. Csuhaj-Varjú, M. Dietzfelbinger, & Z. Ésik (Eds.), 39th International Symposium, MFCS 2014, Budapest, Hungary, 26-29 August 2014 ; proceedings, Part II (57-68). https://doi.org/10.1007/978-3-662-44465-8_6
Conference Name | 39th International Symposium, MFCS 2014 |
---|---|
Conference Location | Budapest, Hungary |
Publication Date | Jan 1, 2014 |
Deposit Date | Dec 20, 2014 |
Publicly Available Date | Mar 29, 2024 |
Pages | 57-68 |
Series Title | Lecture notes in computer science |
Series Number | 8635 |
Series ISSN | 0302-9743,1611-3349 |
Book Title | 39th International Symposium, MFCS 2014, Budapest, Hungary, 26-29 August 2014 ; proceedings, Part II. |
ISBN | 9783662444641 |
DOI | https://doi.org/10.1007/978-3-662-44465-8_6 |
Public URL | https://durham-repository.worktribe.com/output/1154514 |
Files
Accepted Conference Proceeding
(304 Kb)
PDF
Copyright Statement
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-44465-8_6
You might also like
Matching cuts in graphs of high girth and H-free graphs
(2023)
Conference Proceeding
Solving problems on generalized convex graphs via mim-width
(2023)
Journal Article
An algorithmic framework for locally constrained homomorphisms
(2023)
Journal Article
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal
(2023)
Journal Article
Computing Subset Vertex Covers in H-Free Graphs
(2023)
Conference Proceeding
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search