Permutation Groups and the Graph Isomorphism Problem

DOI10.1007/978-3-319-05446-9_11zbMath1345.20004OpenAlexW157401516MaRDI QIDQ2821703

Sumanta Ghosh, Piyush P. Kurur

Publication date: 22 September 2016

Published in: Perspectives in Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-05446-9_11

zbMATH Keywords

algorithmsfinite permutation groupsgraph isomorphisms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Computational Complexity of Computing Symmetries in Finite-Domain Planning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph isomorphism problem
• Does co-NP have short interactive proofs ?
• A polynomial bound for the orders of primitive solvable groups
• On the orders of primitive groups with restricted nonabelian composition factors
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• A note on the graph isomorphism counting problem
• Graphs and finite permutation groups
• On the Structure of Polynomial Time Reducibility