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

First Page		Document Content
Date: 2016-07-30 09:35:21 Graph theory Mathematics Algebra Morphisms Finite groups Permutation groups Algebraic graph theory Graph automorphism Graph isomorphism problem Line graph Symmetric group Graph isomorphism		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 Add to Reading List Source URL: www.cse.iitk.ac.in Download Document from Source Website File Size: 312,81 KB Share Document on Facebook

	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 DocID: 1rkqP - View Document
	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 DocID: 1r7bO - View Document
	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 DocID: 1r0gd - View Document
	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 DocID: 1qTiS - View Document
	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 DocID: 1ppLN - View Document