P.A. Golovach
Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2
Golovach, P.A.; Heggernes, P.; Kratch, D.; Lima, P.T.; Paulusma, D.
Authors
Abstract
Deciding if a graph has a square root is a classical problem, which has been studied extensively both from graph-theoretic and algorithmic perspective. As the problem is NP-complete, substantial effort has been dedicated to determining the complexity of deciding if a graph has a square root belonging to some specific graph class H. There are both polynomial-time solvable and NP-complete results in this direction, depending on H. We present a general framework for the problem if H is a class of sparse graphs. This enables us to generalize a number of known results and to give polynomial-time algorithms for the cases where H is the class of outerplanar graphs and H is the class of graphs of pathwidth at most 2.
Journal Article Type | Article |
---|---|
Acceptance Date | Feb 22, 2019 |
Online Publication Date | Mar 2, 2019 |
Publication Date | Apr 30, 2019 |
Deposit Date | Feb 22, 2019 |
Publicly Available Date | Mar 2, 2020 |
Journal | Algorithmica |
Print ISSN | 0178-4617 |
Electronic ISSN | 1432-0541 |
Publisher | Springer |
Peer Reviewed | Peer Reviewed |
Volume | 81 |
Issue | 7 |
Pages | 2795-2828 |
DOI | https://doi.org/10.1007/s00453-019-00555-y |
Public URL | https://durham-repository.worktribe.com/output/1307495 |
Files
Accepted Journal Article
(440 Kb)
PDF
Copyright Statement
This is a post-peer-review, pre-copyedit version of an article published in Algorithmica. The final authenticated version is available online at: https://doi.org/10.1007/s00453-019-00555-y
You might also like
Classifying Subset Feedback Vertex Set for H-free graphs
(2022)
Presentation / Conference Contribution
Few induced disjoint paths for H-free graphs
(2022)
Presentation / Conference Contribution
An algorithmic framework for locally constrained homomorphisms
(2022)
Presentation / Conference Contribution
The Complexity of L(p,q)-Edge-Labelling
(2022)
Presentation / Conference Contribution
Computing Balanced Solutions for Large International Kidney Exchange Schemes
(2022)
Presentation / Conference Contribution
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