On isomorphism and canonization of tournaments and hypertournaments

Authors:
V. Arvind;Bireswar Das;Partha Mukhopadhyay
Affiliations:
Institute of Mathematical Sciences, Chennai, India;Institute of Mathematical Sciences, Chennai, India;Institute of Mathematical Sciences, Chennai, India
Venue:
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Year:
2006

Citing 4
Cited 4

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

Isomorphism and canonization of tournaments and hypertournaments

Journal of Computer and System Sciences
From invariants to canonization in parallel

CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Canonizing hypergraphs under abelian group action

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Hardness results for tournament isomorphism and automorphism

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science

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, we give an nO(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.