3 citations · 7 across the 15 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
math.CO2024
Finding forest-orderings of tournaments is NP-complete
Pierre Aboulker, Guillaume Aubian, Raul Lopes
Given a class of (undirected) graphs , we say that a Feedback Arc Set (FAS for short) is a -FAS if the graph induced by the edges of (forgetting t…
math.CO2024
Computing the clique number of tournaments
Guillaume Aubian
The clique number of a tournament is the maximum clique number of a graph formed by keeping backwards arcs in an ordering of its vertices. We study the time complexity of computing…