Isomorphism testing of k-spanning tournaments is Fixed Parameter Tractable.

Vikraman Arvind Ilia Ponomarenko Grigory Ryabov

Published in: CoRR (2022)

Keyphrases

fixed parameter tractable
parameterized complexity
computational problems
np complete
np hard
global constraints
database systems
information extraction
graph theory
bounded treewidth
abstract argumentation