DeepAI AI Chat
Log In Sign Up

Isomorphism testing of k-spanning tournaments is Fixed Parameter Tractable

by   Vikraman Arvind, et al.
Semenov Institute of Chemical Physics RAS
The Institute of Mathematical Sciences, Chennai

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.


page 1

page 2

page 3

page 4


Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable

It is known that testing isomorphism of chordal graphs is as hard as the...

Spanning analysis of stock market anomalies under Prospect Stochastic Dominance

We develop and implement methods for determining whether introducing new...

On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model

Given a set of n points P in the plane, each colored with one of the t g...

Spanning trees of smallest maximum degree in subdivisions of graphs

Given a graph G and a positive integer k, we study the question wheth...

Global preferential consistency for the topological sorting-based maximal spanning tree problem

We introduce a new type of fully computable problems, for DSS dedicated ...

Levelable Sets and the Algebraic Structure of Parameterizations

Asking which sets are fixed-parameter tractable for a given parameteriza...