Graph Isomorphism is in SPP ? V. Arvind ∗ and Piyush P Kurur 1 Institute of Mathematical Sciences, Chennai, India Abstract We show that Graph Isomorphism is in the complexity class SPP, and hence it is

Source URL: www.cse.iitk.ac.in

• Computational complexity theory
• Theory of computation
• Complexity classes
• Graph isomorphism problem
• NP
• PP
• Low
• Graph automorphism
• Hidden subgroup problem
• Time complexity
• P
• Chromatic polynomial

Permutation groups and the graph isomorphism problem Sumanta Ghosh and Piyush P Kurur Department of Computer Science and Engineering, Indian Institute of Technology Kanpur, Kanpur, Uttar Pradesh, India

Source URL: www.cse.iitk.ac.in

• Graph theory
• Mathematics
• Algebra
• Morphisms
• Finite groups
• Permutation groups
• Algebraic graph theory
• Graph automorphism
• Graph isomorphism problem
• Line graph
• Symmetric group
• Graph isomorphism

TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel

Source URL: www.iwr.uni-heidelberg.de

• Graph theory
• Mathematics
• Computational complexity theory
• NP-complete problems
• Graph
• Travelling salesman problem
• Vertex
• Cycle
• Hamiltonian path
• Graph automorphism
• Vertex cover

TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel

Source URL: comopt.ifi.uni-heidelberg.de

• Graph theory
• Mathematics
• Computational complexity theory
• NP-complete problems
• Graph
• Travelling salesman problem
• Vertex
• Cycle
• Hamiltonian path
• Graph automorphism
• Vertex cover

Graph Isomorphism is in SPP V. Arvind and Piyush P Kurur Institute of Mathematical Sciences, C.I.T Campus Chennai, India email: {arvind,ppk}@imsc.ernet.in Abstract

Source URL: www.cse.iitk.ac.in

• Complexity classes
• Finite groups
• Combinatorial group theory
• Graph isomorphism problem
• Morphisms
• Hidden subgroup problem
• Permutation group
• Permutation
• Graph canonization
• ArthurMerlin protocol
• Graph automorphism
• NP

Symmetry Detection in General Game Playing Stephan Schiffel Department of Computer Science Dresden University of Technology

Source URL: ggp.stanford.edu

• Symmetry
• Algebraic graph theory
• Graph automorphism
• Symmetry in mathematics
• Regular icosahedron
• Graph coloring
• Graph
• Petersen graph
• Nauru graph

Representing groups on graphs Sagarmoy Dutta and Piyush P Kurur Department of Computer Science and Engineering, Indian Institute of Technology Kanpur, Kanpur, Uttar Pradesh, India {sagarmoy,ppk}@cse.iitk.ac.in

Source URL: www.cse.iitk.ac.in

• Group theory
• Morphisms
• Symmetry
• Graph isomorphism problem
• Representation theory
• Solvable group
• Graph isomorphism
• Commutator subgroup
• Symmetric group
• Group action
• Direct product of groups
• Automorphism

Automorphism groups of hypergraphs and switching classes Peter J. Cameron University of St Andrews In 1939, Frucht proved a classic theorem asserting that every finite group is the automorphism group of a finite graph. T

Source URL: www-circa.mcs.st-andrews.ac.uk

Abstract Alexander Ivanov Imperial College London Let G be a subgroup in the automorphism group of a graph X. The action of G on X

Source URL: math.ipm.ac.ir

GAP Exercises Version 1.0 February 17, 2010 Stefan Kohl

Source URL: www.gap-system.org

• Symmetry
• Number theory
• Morphisms
• Outer automorphism group
• Graph automorphism
• Symmetric group
• Automorphism
• Abelian group
• Divisor function
• Abstract algebra
• Mathematics
• Group theory