Hardness Results for Tournament Isomorphism and Automorphism
From MaRDI portal
Publication:3525602
DOI10.1007/978-3-540-74456-6_51zbMath1147.05305OpenAlexW1594646623MaRDI QIDQ3525602
Publication date: 17 September 2008
Published in: Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74456-6_51
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (4)
The isomorphism problem for planar 3-connected graphs is in unambiguous logspace ⋮ Oriented coloring on recursively defined digraphs ⋮ Kernelization of Whitney Switches ⋮ Kernelization of Whitney Switches
This page was built for publication: Hardness Results for Tournament Isomorphism and Automorphism
