Isomorphism and canonization of tournaments and hypertournaments

Authors:
V. Arvind;Bireswar Das;Partha Mukhopadhyay
Affiliations:
Institute of Mathematical Sciences, C.I.T Campus, Chennai 600 113, India;Institute of Mathematical Sciences, C.I.T Campus, Chennai 600 113, India;Institute of Mathematical Sciences, C.I.T Campus, Chennai 600 113, India
Venue:
Journal of Computer and System Sciences
Year:
2010

Citing 7
Cited 0

Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class

Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
The graph isomorphism problem: its structural complexity

The graph isomorphism problem: its structural complexity
Hamiltonian paths and cycles in hypertournaments

Journal of Graph Theory
Hypergraph isomorphism and structural equivalence of Boolean functions

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Canonical labeling of graphs

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Isomorhism of Hypergraphs of Low Rank in Moderately Exponential Time

FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
On isomorphism and canonization of tournaments and hypertournaments

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

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 (Babai and Luks (1983) [4]), we give an n^O^(^k^^^2^+^l^o^g^n^) algorithm for canonization and isomorphism testing of k-hypertournaments, where n is the number of vertices and k is the size of hyperedges.