Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2
Preprint
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.Keywords
All Related Versions
This publication has 25 references indexed in Scilit:
- Finding Cactus Roots in Polynomial TimeTheory of Computing Systems, 2017
- Parameterized Algorithms for Finding Square RootsAlgorithmica, 2014
- A characterization of line graphs that are squares of graphsDiscrete Applied Mathematics, 2014
- Square roots of minor closed graph classesDiscrete Applied Mathematics, 2014
- Computing square roots of trivially perfect and threshold graphsDiscrete Applied Mathematics, 2013
- Complexity of Finding Graph Roots with Girth ConditionsAlgorithmica, 2010
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of GraphsJournal of Algorithms, 1996
- Obstruction set isolation for the gate matrix layout problemDiscrete Applied Mathematics, 1994
- Computing roots of graphs is hardDiscrete Applied Mathematics, 1994
- The Square of a TreeBell System Technical Journal, 1960