On the absolute and relative oriented clique problems’ time complexity

• Published in: Procedia computer science Vol. 223; pp. 275 - 282
• Main Authors: Coelho, E.M.M., Coelho, H., Faria, L., Ferreira, M.P., Klein, S.
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 2023
• Subjects: non-appromability; NP-complete; oriented absolute clique; oriented chromatic number; oriented relative clique; parameterized complexity; 68Q15; non-appromability; oriented relative clique; parameterized complexity; oriented chromatic number; NP-complete; oriented absolute clique; 68W25; 05C15
• ISSN: 1877-0509; 1877-0509
• DOI: 10.1016/j.procs.2023.08.238

Let ⃗G = (V, A) be an oriented graph. An oriented k-coloring of ⃗G is a partition of V into k color classes, such that there is no pair of adjacent vertices belonging to the same class and all the arcs between a pair of color classes have the same orientation. The smallest k such that ⃗G admits an oriented k-coloring is the oriented chromatic number Xo(⃗G) = k of ⃗G. In an oriented coloring of ⃗G every pair of vertices with oriented distance at most 2 in ⃗G have different colors. In 2004, Klostermeyer and MacGillivray defined the concept of an “analogue of clique” for oriented coloring in which a subgraph ⃗H of ⃗G is an oriented clique if every pair of vertices of ⃗H is in an oriented distance of at most 2 in ⃗H. The authors defined the absolute oriented clique number of ⃗G as the number of vertices |V(H)| = ωao(⃗G) of the largest oriented clique ⃗H of ⃗G and satisfies that ωao(⃗G) ≤ Xo(⃗G). Ever since, for almost 20 years, the time complexity status of this parameter remained unknown. The relative oriented clique number ωao(⃗G) of an oriented graph ⃗G is the size of the largest set of vertices R, such that every pair of vertices of R is at a maximum oriented distance of 2 in R. For every oriented graph ⃗G, ωao(⃗G) ≤ ωro(⃗G) ≤ Xo(⃗G). In this paper we classify Absolute Oriented Clique - the Klostermeyer and Mac Gillivray's decision problem - proving that given an oriented graph ⃗G and a positive integer k it is NP-complete to decide whether ωao(⃗G) ≥ k. We prove that for all ε > 0, there is no polynomial-time approximation for Relative Oriented Clique and for Absolute Oriented Clique within a factor of n1_ε, unless P = NP. Finally, we prove that Relative Oriented Clique is W[1]-complete and that Absolute Oriented Clique belongs to W[2] and is W[1]-hard.