, Volume 29, Issue 1-2, pp 139-160

Polynomial time algorithms for recognizing and isomorphism testing of cyclic tournaments

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

In [3] the problem of finding an efficient criterion for isomorphism testing of cyclic graphs was posed. In the context of the theory of computational complexity the problem reduces to that of the existence of a polynomial-time algorithm for recognizing their isomorphism. The main result of the present paper is an algorithm for finding among all tournaments the cyclic ones. For cyclic tournaments generators of the automorphism group and the set of canonical labels are constructed. The running time of the algorithm is bounded by a polynomial function of the number of input tournament vertices. Thus an affirmative answer to the above problem is obtained.