A polynomial-time randomized reduction from tournament isomorphism to tournament asymmetry

DOI10.4230/LIPIcs.ICALP.2017.66zbMath1441.68196arXiv1704.08529MaRDI QIDQ5111397

Pascal Schweitzer

Publication date: 27 May 2020

Full work available at URL: https://arxiv.org/abs/1704.08529

zbMATH Keywords

asymmetrytournamentsgraph isomorphismrandomized reductions

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20) Randomized algorithms (68W20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

Algorithmic problems in right-angled Artin groups: complexity and applications ⋮ Kernelization of Whitney Switches ⋮ Kernelization of Whitney Switches

This page was built for publication: A polynomial-time randomized reduction from tournament isomorphism to tournament asymmetry