N. Brettell
Computing weighted subset transversals in H-free graphs
Brettell, N.; Johnson, M.; Paulusma, D.
Authors
Professor Matthew Johnson matthew.johnson2@durham.ac.uk
Head Of Department
Professor Daniel Paulusma daniel.paulusma@durham.ac.uk
Professor
Contributors
A. Lubiw
Editor
M. Salavatipour
Editor
Chuck He mu.he@durham.ac.uk
Editor
Abstract
For the Odd Cycle Transversal problem, the task is to nd a small set S of vertices in a graph that intersects every cycle of odd length. The Subset Odd Cycle Transversal requires S to intersect only those odd cycles that include a vertex of a distinguished vertex subset T. If we are given weights for the vertices, we ask instead that S has small weight: this is the problem Weighted Subset Odd Cycle Transversal. We prove an almost-complete complexity dichotomy for Weighted Subset Odd Cycle Transversal for graphs that do not contain a graph H as an induced subgraph. Our general approach can also be used for Weighted Subset Feedback Vertex Set, which enables us to generalize a recent result of Papadopoulos and Tzimas.
Citation
Brettell, N., Johnson, M., & Paulusma, D. (2021). Computing weighted subset transversals in H-free graphs. In A. Lubiw, M. Salavatipour, & M. He (Eds.), Algorithms and Data Structures 17th International Symposium, WADS 2021, Virtual Event, August 9–11, 2021, Proceedings (229-242). https://doi.org/10.1007/978-3-030-83508-8_17
Conference Name | WADS 2021 |
---|---|
Conference Location | Halifax, Nova Scotia |
Start Date | Aug 9, 2021 |
End Date | Aug 11, 2021 |
Acceptance Date | Apr 13, 2021 |
Online Publication Date | Jul 31, 2021 |
Publication Date | 2021 |
Deposit Date | May 28, 2021 |
Publicly Available Date | Jun 1, 2021 |
Publisher | Springer Verlag |
Pages | 229-242 |
Series Title | Lecture Notes in Computer Science |
Series Number | 12808 |
Series ISSN | 0302-9743 |
Book Title | Algorithms and Data Structures 17th International Symposium, WADS 2021, Virtual Event, August 9–11, 2021, Proceedings |
ISBN | 978-3-030-83507-1 |
DOI | https://doi.org/10.1007/978-3-030-83508-8_17 |
Public URL | https://durham-repository.worktribe.com/output/1139387 |
Files
Accepted Conference Proceeding
(376 Kb)
PDF
Copyright Statement
The final authenticated version is available online at https://doi.org/https://doi.org/10.1007/978-3-030-83508-8_17
You might also like
Independent transversals versus transversals
(2019)
Conference Proceeding
Connected vertex cover for (sP1+P5)-free graphs
(2019)
Journal Article
Filling the complexity gaps for colouring planar and bounded degree graphs
(2019)
Journal Article
Finding a small number of colourful components
(2019)
Conference Proceeding
Clique-width for hereditary graph classes
(2019)
Journal Article
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