20.500.12556/RUP-22072 Isomorphism testing of k-spanning tournaments is fixed parameter tractable Testiranje izomorfizmak-razteznih turnirjev je sledljivo s fiksnim parametrom 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. graph isomorphism problem colored tournaments fixed-parameter tractable algorithm problem izomorfizma grafov barvni turnirji sledljiv algoritem s fiksnim parametrom true false true Založba Univerze na Primorskem Angleški jezik Slovenski jezik Članek v reviji 2025-11-03 12:07:13 2025-11-03 12:07:13 2025-11-18 03:05:04 0000-00-00 00:00:00 2025 0 0 9 str. no. 2, [article no.] P2.10 Vol. 8 2025 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 2025-04-07 51 2590-9770 https://doi.org/10.26493/2590-9770.1712.3ec ADAM_Arvind,Ponomarenko,Ryabov_2025.pdf ADAM_Arvind,Ponomarenko,Ryabov_2025.pdf 1 BFC98983940DB929F710F3F410770077 692474dadf88b42abc5c88b4b6e4d1f71564bfecd9307aaca96f892669224623 d29933db-b8a5-11f0-8f0b-005056ac49c0 https://repozitorij.upr.si/Dokument.php?lang=slv&id=32017 Založba Univerze na Primorskem 0 0 0