DeepAI AI Chat
Log In Sign Up

Isomorphism testing of k-spanning tournaments is Fixed Parameter Tractable

01/28/2022
by   Vikraman Arvind, et al.
Semenov Institute of Chemical Physics RAS
The Institute of Mathematical Sciences, Chennai
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

07/22/2021

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...
04/06/2020

Spanning analysis of stock market anomalies under Prospect Stochastic Dominance

We develop and implement methods for determining whether introducing new...
05/14/2018

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...
10/10/2022

Spanning trees of smallest maximum degree in subdivisions of graphs

Given a graph G and a positive integer k, we study the question wheth...
03/29/2012

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

We introduce a new type of fully computable problems, for DSS dedicated ...
09/14/2017

Levelable Sets and the Algebraic Structure of Parameterizations

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