
Approximation schemes for bounded distance problems on fractionally treewidthfragile graphs
We give polynomialtime approximation schemes for monotone maximization ...
read it

Constructing bounded degree graphs with prescribed degree and neighbor degree sequences
Let D = d_1, d_2, …, d_n and F = f_1, f_2,…, f_n be two sequences of pos...
read it

FO and MSO approach to Some Graph Problems: Approximation and Poly time Results
The focus of this paper is two fold. Firstly, we present a logical appro...
read it

The kpath coloring problem in graphs with bounded treewidth: an application in integrated circuit manufacturing
In this paper, we investigate the kpath coloring problem, a variant of ...
read it

Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs
Given a planar graph G and an integer b, OrthogonalPlanarity is the prob...
read it

Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth
Many combinatorial problems can be solved in time O^*(c^tw) on graphs of...
read it

Hyperbolic intersection graphs and (quasi)polynomial time
We study unit ball graphs (and, more generally, socalled noisy uniform ...
read it
The generalized locally checkable problem in bounded treewidth graphs
We introduce a new problem that generalizes some previous attempts of covering locally checkable problems under the same umbrella. Optimization and decision problems such as {k}dominating set, bcoloring, acyclic coloring and connected dominating set, can be seen as instances of this new problem. We prove that this new problem can be solved, under mild conditions, in polynomial time for bounded treewidth graphs. As a consequence, we obtain polynomialtime algorithms to solve, for bounded treewidth graphs, Grundy domination and double Roman domination, among other problems for which no such algorithm was previously known. Moreover, by proving that (fixed) powers of bounded degree and bounded treewidth graphs are also bounded degree and bounded treewidth graphs, we can enlarge the family of problems that can be solved in polynomial time for these graph classes, including distance coloring problems and distance domination problems (for bounded distances).
READ FULL TEXT
Comments
There are no comments yet.