Polynomial time recognition and testing of isomorphism of cyclic tournaments

DOI10.1007/BF02112430zbMath0835.68051OpenAlexW2029999651MaRDI QIDQ1190955

Ilya Nikolaevich Ponomarenko

Publication date: 27 September 1992

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02112430

zbMATH Keywords

automorphism groupsSchur ringsisomorphism problem for cyclic tournaments

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• A polynomial bound for the orders of primitive solvable groups
• On construction and identification of graphs. With contributions by A. Lehman, G. M. Adelson-Velsky, V. Arlazarov, I. Faragev, A. Uskov, I. Zuev, M. Rosenfeld and B. Weisfeiler
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Polynomial time recognition and testing of isomorphism of cyclic tournaments