Isomorphism and canonization of tournaments and hypertournaments

DOI10.1016/j.jcss.2009.09.001zbMath1231.05107OpenAlexW2044058303MaRDI QIDQ988566

V. Arvind, Bireswar Das, Partha Mukhopadhyay

Publication date: 18 August 2010

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2009.09.001

zbMATH Keywords

permutation groupstournamentspolynomial timegraph isomorphismTuring reductions

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Permutation groups (20B99)

Related Items (2)

Bases of Schurian antisymmetric coherent configurations and an isomorphism test for Schurian tournaments ⋮ The parallel complexity of graph canonization under abelian group action

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
• A polynomial bound for the orders of primitive solvable groups
• On the orders of primitive groups with restricted nonabelian composition factors
• Solvability of groups of odd order
• Hypergraph isomorphism and structural equivalence of Boolean functions
• Solvable and Nilpotent Subgroups of GL(n,q^m)
• Simple groups, permutation groups, and probability
• Hamiltonian paths and cycles in hypertournaments
• On Isomorphism and Canonization of Tournaments and Hypertournaments

This page was built for publication: Isomorphism and canonization of tournaments and hypertournaments