Isomorphism testing of k-spanning tournaments is fixed parameter tractableArvind, Vikraman (Avtor) Ponomarenko, Ilia (Avtor) Ryabov, Grigory (Avtor) graph isomorphism problemcolored tournamentsfixed-parameter tractable algorithmAn arc-colored tournament is said to be k-spanning for an integer k ≥ 1 if the union of its arc-color classes of maximal valency at most k is the arc set of a strongly connected digraph. It is proved that isomorphism testing of k-spanning tournaments is fixed-parameter tractable.Založba Univerze na Primorskem20252025-11-03 12:07:13Članek v reviji22072UDK: 51eISSN: 2590-9770DOI: https://doi.org/10.26493/2590-9770.1712.3ecsl