论文标题
$ k $ - 跨度锦标赛的同构测试是固定参数
Isomorphism testing of $k$-spanning tournaments is Fixed Parameter Tractable
论文作者
论文摘要
据说，如果全部最大价为$ k $，则据说整数$ k \ geq 1 $的弧形锦标赛是$ k $ s的。事实证明，$ k $ spanning锦标赛的同构测试是固定参数可进行的。
An arc-colored tournament is said to be $k$-spanning for an integer $k\geq 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.
