Polynomial time algorithms for recognizing and isomorphism testing of cyclic tour-naments

DOI10.1007/BF00053383zbMath0778.05077MaRDI QIDQ1201912

Ilya Nikolaevich Ponomarenko

Publication date: 17 January 1993

Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)

zbMATH Keywords

complexityautomorphism groupisomorphismpolynomial algorithmscyclic tournaments

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (6)

On computation complexity problems concerning relation algebras ⋮ On the geometric graph isomorphism problem ⋮ Powers of cycles, powers of paths, and distance graphs ⋮ Circulant graphs: recognizing and isomorphism testing in polynomial time ⋮ Finding a cycle base of a permutation group in polynomial time ⋮ Circulant graphs: efficient recognizing and isomorphism testing

Cites Work

• A polynomial bound for the orders of primitive solvable groups
• Galois correspondence between permutation groups and cellular rings (association schemes)
• 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
• Solvability of groups of odd order
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Polynomial time algorithms for recognizing and isomorphism testing of cyclic tour-naments