M. Cochefert
Sparse Square Roots
Cochefert, M.; Couturier, J-F.; Golovach, P. A.; Kratsch, D.; Paulusma, D.
Authors
J-F. Couturier
P. A. Golovach
D. Kratsch
Professor Daniel Paulusma daniel.paulusma@durham.ac.uk
Professor
Contributors
Andreas Brandstädt
Editor
Klaus Jansen
Editor
Rüdiger Reischuk
Editor
Abstract
We show that it can be decided in polynomial time whether a graph of maximum degree 6 has a square root; if a square root exists, then our algorithm finds one with minimum number of edges. We also show that it is FPT to decide whether a connected n-vertex graph has a square root with at most n − 1 + k edges when this problem is parameterized by k. Finally, we give an exact exponential time algorithm for the problem of finding a square root with maximum number of edges.
Citation
Cochefert, M., Couturier, J., Golovach, P. A., Kratsch, D., & Paulusma, D. (2013). Sparse Square Roots. In A. Brandstädt, K. Jansen, & R. Reischuk (Eds.), Graph-theoretic concepts in computer science : 39th International Workshop, WG 2013, Lübeck, Germany, 19-21 June 2013 ; revised papers (177-188). https://doi.org/10.1007/978-3-642-45043-3_16
Conference Name | 39th International Workshop, WG 2013 |
---|---|
Conference Location | Lübeck, Germany |
Publication Date | Jan 1, 2013 |
Deposit Date | Dec 20, 2014 |
Publicly Available Date | Jan 14, 2015 |
Pages | 177-188 |
Series Title | Lecture notes in computer science |
Series Number | 8165 |
Series ISSN | 0302-9743,1611-3349 |
Book Title | Graph-theoretic concepts in computer science : 39th International Workshop, WG 2013, Lübeck, Germany, 19-21 June 2013 ; revised papers. |
ISBN | 9783642450426 |
DOI | https://doi.org/10.1007/978-3-642-45043-3_16 |
Public URL | https://durham-repository.worktribe.com/output/1154605 |
Files
Accepted Conference Proceeding
(352 Kb)
PDF
Copyright Statement
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-45043-3_16
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
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
Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius
(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