
Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable
Author(s) -
M. S. Ramanujan,
Stefan Szeider
Publication year - 2017
Publication title -
proceedings of the ... aaai conference on artificial intelligence
Language(s) - Uncategorized
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v31i1.11132
Subject(s) - tournament , parameterized complexity , feedback arc set , bounded function , set (abstract data type) , mathematics , function (biology) , combinatorics , directed acyclic graph , mathematical optimization , computer science , mathematical economics , graph , discrete mathematics , mathematical analysis , voltage graph , line graph , evolutionary biology , biology , programming language