Hardness Results for Tournament Isomorphism and Automorphism
نویسنده
چکیده
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing seems to be easier to compute than for the isomorphism problem of general graphs. We show that tournament isomorphism and tournament automorphism is hard under DLOGTIME uniform AC many-one reductions for the complexity classes NL, C=L , PL (probabilistic logarithmic space), for logarithmic space modular counting classes ModkL with odd k ≥ 3 and for DET, the class of problems, NC reducible to the determinant. These lower bounds have been proven for graph isomorphism, see [21].
منابع مشابه
A Polynomial-Time Randomized Reduction from Tournament Isomorphism to Tournament Asymmetry
The paper develops a new technique to extract a characteristic subset from a random source that repeatedly samples from a set of elements. Here a characteristic subset is a set that when containing an element contains all elements that have the same probability. With this technique at hand the paper looks at the special case of the tournament isomorphism problem that stands in the way towards a...
متن کاملAlgorithms for classification of combinatorial objects
A recurrently occurring problem in combinatorics is the need to completely characterize a finite set of finite objects implicitly defined by a set of constraints. For example, one could ask for a list of all possible ways to schedule a football tournament for twelve teams: every team is to play against every other team during an eleven-round tournament, such that every team plays exactly one ga...
متن کاملHardness results for isomorphism and automorphism of bounded valence graphs
In a bounded valence graph every vertex has O(1) neighbours. Testing isomorphism of bounded valence graphs is known to be in P [15], something that is not clear to hold for graph isomorphism in general. We show that testing isomorphism for undirected, directed and colored graphs of valence 2 is logspace complete. We also prove the following: If a special version of bounded valence GI is hard fo...
متن کاملCountable Homogeneous Tournaments
A tournament Tis called homogeneous just in case every isomorphism of subtournaments of smaller cardinality can be lifted to an automorphism of T. It is shown that there are precisely three homogeneous tournaments of power N(). Some analogous results for 2-tournaments are obtained. In this paper we characterize countable tournaments which are homogeneous in the sense of Fraissé [1]. As far as w...
متن کاملProperties of K-tournaments
In this thesis, we investigate several properties of k-tournaments, where k 2 3. These properties fall into three broad areas. The first contains properties related to the ranking of the participants in a k-tournament, including a representation theorem for posets. The second contains properties related to the representation of a finite group as the automorphism group of a k-tournament, with va...
متن کامل