P.A. Golovach
Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2
Golovach, P.A.; Heggernes, P.; Kratsch, D.; Lima, P.T.; Paulusma, D.
Authors
Contributors
Hans L. Bodlaender
Editor
Gerhard J. Woeginger
Editor
Abstract
Deciding whether a given graph has a square root is a classical problem that has been studied extensively both from graph theoretic and from algorithmic perspectives. The problem is NP-complete in general, and consequently substantial effort has been dedicated to deciding whether a given graph has a square root that belongs to a particular graph class. There are both polynomial-time solvable and NP-complete cases, depending on the graph class. We contribute with new results in this direction. Given an arbitrary input graph G, we give polynomial-time algorithms to decide whether G has an outerplanar square root, and whether G has a square root that is of pathwidth at most 2.
Citation
Golovach, P., Heggernes, P., Kratsch, D., Lima, P., & Paulusma, D. (2017). Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2. In H. L. Bodlaender, & G. J. Woeginger (Eds.), Graph-Theoretic Concepts in Computer Science : 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017. Revised selected papers (275-288). https://doi.org/10.1007/978-3-319-68705-6_21
Conference Name | 43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2017) |
---|---|
Conference Location | Eindhoven, The Netherlands |
Start Date | Jun 21, 2017 |
End Date | Jun 23, 2017 |
Acceptance Date | Jul 31, 2017 |
Online Publication Date | Nov 2, 2017 |
Publication Date | Jun 23, 2017 |
Deposit Date | May 31, 2017 |
Publicly Available Date | Nov 2, 2018 |
Pages | 275-288 |
Series Title | Lecture notes in computer science |
Series Number | 10520 |
Series ISSN | 0302-9743,1611-3349 |
Book Title | Graph-Theoretic Concepts in Computer Science : 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017. Revised selected papers. |
ISBN | 9783319687049 |
DOI | https://doi.org/10.1007/978-3-319-68705-6_21 |
Public URL | https://durham-repository.worktribe.com/output/1148413 |
Files
Accepted Conference Proceeding
(340 Kb)
PDF
Copyright Statement
The final publication is available at Springer via https://doi.org/10.1007/978-3-319-68705-6_21.
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