Abstract
We give a polynomial-time oracle algorithm for Tournament Canonization that accesses oracles for Tournament Isomorphism and Rigid-Tournament Canonization. Extending the Babai-Luks Tournament Canonization algorithm, we give an n O(k + logn) algorithm for canonization and isomorphism testing of k-hypertournaments, where n is the number of vertices and k is the size of hyperedges.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Babai, L., Cameron, P.J., Pálfy, P.P.: On the order of primitive groups with restricted nonabelian composition factors. Journal of Algebra 79, 161–168 (1982)
Babai, L., Luks, E.M.: Canonical labeling of graphs. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, pp. 171–183 (1983)
Feit, W., Thompson, J.: Solvability of groups of odd order. Pacific Journal of Mathematics 13, 775–1029 (1963)
Gutin, G., Yeo, A.: Hamiltonian Paths and Cycles in Hypertournaments. Journal of Graph Theory 25(4), 277–286 (1997)
Köbler, J., Schöning, U., Torán, J.: The Graph Isomorphism Problem: Its Structural Complexity. Birkhäuser, Boston (1993)
Liebeck, M., Shalev, A.: Simple groups, permutation groups and probability. Journal of Amer. Math. Soc. 12, 497–520 (1999)
Luks, E.M.: Permutation groups and polynomial time computations. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 11, 139–175 (1993)
Luks, E.M.: Hypergraph isomorphism and structural equivalence of boolean functions. In: Proc. 31st ACM Symposium on Theory of Computing, pp. 652–658. ACM Press, New York (1999)
Wielandt, H.: Finite Permutation Groups. Acad. Press, New York (1964)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arvind, V., Das, B., Mukhopadhyay, P. (2006). On Isomorphism and Canonization of Tournaments and Hypertournaments. In: Asano, T. (eds) Algorithms and Computation. ISAAC 2006. Lecture Notes in Computer Science, vol 4288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11940128_46
Download citation
DOI: https://doi.org/10.1007/11940128_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49694-6
Online ISBN: 978-3-540-49696-0
eBook Packages: Computer ScienceComputer Science (R0)