Pages that link to "Item:Q1201912"

The following pages link to Polynomial time algorithms for recognizing and isomorphism testing of cyclic tour-naments (Q1201912):

Displaying 9 items.

• Powers of cycles, powers of paths, and distance graphs (Q531605) (← links)
• Finding a cycle base of a permutation group in polynomial time (Q724293) (← links)
• Isomorphism and canonization of tournaments and hypertournaments (Q988566) (← links)
• Polynomial time recognition and testing of isomorphism of cyclic tournaments (Q1190955) (← links)
• On cyclic tournaments (Q1196291) (← links)
• On computation complexity problems concerning relation algebras (Q1329260) (← links)
• On the geometric graph isomorphism problem (Q1358911) (← links)
• Circulant graphs: efficient recognizing and isomorphism testing (Q3439301) (← links)
• Circulant graphs: recognizing and isomorphism testing in polynomial time (Q4675535) (← links)