<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://repozitorij.upr.si/IzpisGradiva.php?id=22072"><dc:title>Isomorphism testing of k-spanning tournaments is fixed parameter tractable</dc:title><dc:creator>Arvind,	Vikraman	(Avtor)
	</dc:creator><dc:creator>Ponomarenko,	Ilia	(Avtor)
	</dc:creator><dc:creator>Ryabov,	Grigory	(Avtor)
	</dc:creator><dc:subject>graph isomorphism problem</dc:subject><dc:subject>colored tournaments</dc:subject><dc:subject>fixed-parameter tractable algorithm</dc:subject><dc:description>An 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.</dc:description><dc:publisher>Založba Univerze na Primorskem</dc:publisher><dc:date>2025</dc:date><dc:date>2025-11-03 12:07:13</dc:date><dc:type>Članek v reviji</dc:type><dc:identifier>22072</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>