# Weighted proper orientations of trees and graphs of bounded treewidth

Given a simple graph G, a weight function w:E(G)→N∖{0}, and an orientation D of G, we define μ^-(D) = _v ∈ V(G) w_D^-(v), where w^-_D(v) = ∑_u∈ N_D^-(v)w(uv). We say that D is a weighted proper orientation of G if w^-_D(u) ≠ w^-_D(v) whenever u and v are adjacent. We introduce the parameter weighted proper orientation number of G, denoted by χ(G,w), which is the minimum, over all weighted proper orientations D of G, of μ^-(D). When all the weights are equal to 1, this parameter is equal to the proper orientation number of G, which has been object of recent studies and whose determination is NP-hard in general, but polynomial-time solvable on trees. Here, we prove that the equivalent decision problem of the weighted proper orientation number (i.e., χ(G,w) ≤ k?) is (weakly) NP-complete on trees but can be solved by a pseudo-polynomial time algorithm whose running time depends on k. Furthermore, we present a dynamic programming algorithm to determine whether a general graph G on n vertices and treewidth at most tw satisfies χ(G,w) ≤ k, running in time O(2^ tw^2· k^3 tw· tw· n), and we complement this result by showing that the problem is W[1]-hard on general graphs parameterized by the treewidth of G, even if the weights are polynomial in n.

• 7 publications
• 1 publication
• 29 publications
• 18 publications
research
05/08/2019

### On the semi-proper orientations of graphs

A semi-proper orientation of a given graph G is a function (D,w) that a...
research
11/30/2020

### On the proper orientation number of chordal graphs

An orientation D of a graph G=(V,E) is a digraph obtained from G by repl...
research
04/12/2020

### Linear-time Algorithms for Eliminating Claws in Graphs

Since many NP-complete graph problems have been shown polynomial-time so...
research
04/27/2021

### Minimum Stable Cut and Treewidth

A stable cut of a graph is a cut whose weight cannot be increased by cha...
research
06/27/2019

### The Weighted Sitting Closer to Friends than Enemies Problem in the Line

The weighted Sitting Closer to Friends than Enemies (SCFE) problem is to...
research
11/25/2019

### Orienting Ordered Scaffolds: Complexity and Algorithms

Despite the recent progress in genome sequencing and assembly, many of t...
research
05/16/2022

### The Smallest Hard Trees

We find an orientation of a tree with 20 vertices such that the correspo...