Hardness results for tournament isomorphism and automorphism

11Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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 AC0 many-one reductions for the complexity classes NL, C=L, PL (probabilistic logarithmic space), for logarithmic space modular counting classes MOD kL with odd k ≥ 3 and for DET, the class of problems, NC 1 reducible to the determinant. These lower bounds have been proven for graph isomorphism, see [21]. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Wagner, F. (2007). Hardness results for tournament isomorphism and automorphism. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4708 LNCS, pp. 572–583). Springer Verlag. https://doi.org/10.1007/978-3-540-74456-6_51

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free