DeepAI AI Chat
Log In Sign Up

Degreewidth: a New Parameter for Solving Problems on Tournaments

by   Tom Davot, et al.

In the paper, we define a new parameter for tournaments called degreewidth which can be seen as a measure of how far is the tournament from being acyclic. The degreewidth of a tournament T denoted by Δ(T) is the minimum value k for which we can find an ordering ⟨ v_1, …, v_n ⟩ of the vertices of T such that every vertex is incident to at most k backward arcs (i.e. an arc (v_i,v_j) such that j<i). Thus, a tournament is acyclic if and only if its degreewidth is zero. Additionally, the class of sparse tournaments defined by Bessy et al. [ESA 2017] is exactly the class of tournaments with degreewidth one. We first study computational complexity of finding degreewidth. Namely, we show it is NP-hard and complement this result with a 3-approximation algorithm. We also provide a cubic algorithm to decide if a tournament is sparse. Finally, we study classical graph problems Dominating Set and Feedback Vertex Set parameterized by degreewidth. We show the former is fixed parameter tractable whereas the latter is NP-hard on sparse tournaments. Additionally, we study Feedback Arc Set on sparse tournaments.


page 1

page 2

page 3

page 4


Algorithms and complexity for geodetic sets on planar and chordal graphs

We study the complexity of finding the geodetic number on subclasses of ...

Reducing graph transversals via edge contractions

For a graph parameter π, the Contraction(π) problem consists in, given a...

Tight Localizations of Feedback Sets

The classical NP-hard feedback arc set problem (FASP) and feedback verte...

Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set

The goal of this paper is to open up a new research direction aimed at u...

New Algorithms for Weighted k-Domination and Total k-Domination Problems in Proper Interval Graphs

Given a positive integer k, a k-dominating set in a graph G is a set of ...

Solving group Steiner problems as Steiner problems: the rigorous proof

The Steiner tree problems are well-known NP-hard problems that have dive...

Min (A)cyclic Feedback Vertex Sets and Min Ones Monotone 3-SAT

In directed graphs, we investigate the problems of finding: 1) a minimum...