On the absolute and relative oriented clique problems’ time complexity

Abstract

Given a graph G = ( V ( G ), E ( G ) ), the size of the largest clique ω ( G ) is always less than or equal to the chromatic number χ ( G ) of G. The oriented coloring of an oriented graph G assigns colors to the vertices of G ⃗, such that the arcs connecting vertices in different color classes always have the same direction and the smallest number χ o ( G ) of colors in an oriented coloring is the oriented chromatic number of G ⃗. Oriented colorings have fundamental implications for homomorphisms of oriented graphs and significant applications in distributed processing and task scheduling. In 2004, Klostermeyer and MacGillivray defined the concept of an “analogue of clique” for oriented coloring in which a subgraph C a o of G is an absolute oriented clique if the oriented distance between a pair of vertices of C a o in C a o is at most 2. The authors defined the absolute oriented clique number of G as the number of vertices | V ( C a o ) | = χ o ( C a o ) = ω a o ( G ) in a maximum absolute oriented clique C a o of G satisfying that ω a o ( G ) ≤ χ o ( G ). Ever since, for 20 years, the time complexity status of the problem of finding this parameter remained open. Recently in 2016, Sopena et al. defined the relative oriented clique number ω r o ( G ) of an oriented graph G as the size | R r o | of a maximum set of vertices R r o, such that the oriented distance between a pair of vertices of R r o in G is at most 2. For every oriented graph G ⃗, ω a o ( G ) ≤ ω r o ( G ) ≤ χ o ( G ). In this paper we classify the Klostermeyer and MacGillivray’s decision open problem proving that given an oriented graph G and a positive integer k it is N P-complete to decide whether ω a o ( G ) ≥ k, even if the underlying graph G is bipartite. We analyze the approximation and parameterization behaviors of the both associated optimization problems: absolute oriented clique and relative oriented clique. We prove that if P ≠ N P, then the polynomial approximation ratio of both problems is greater than n 1 − ϵ for all ϵ > 0. If the maximum degree Δ of the underlying graph G is bounded, then there is a polynomial-time ⌊ 3 1 + Δ + ⌊ Δ 2 2 ⌋ ⌋-approximation algorithm and an F P T parameterized algorithm in the parameter Δ for both absolute oriented clique and relative oriented clique is devised. We prove that absolute oriented clique is W [ 2 ] and is W [ 1 ]-hard and that relative oriented clique is W [ 1 ]-complete in the parameter k of the size of the solution. We proved a general result that if the absolute oriented clique or the relative oriented clique sizes are bounded for a given class of graphs, then there is a polynomial time algorithm for the corresponding problem in this class. This result implies that both problems are polynomial in the class of oriented planar graphs.