<--- Back to Details
First PageDocument Content
Algebra / Differential geometry / Algebraic graph theory / Representation theory / Group / Matrix / Icosahedron / Graph automorphism / Adjacency matrix / Symmetry / Geometry / Mathematics
Date: 2010-07-07 08:29:04
Algebra
Differential geometry
Algebraic graph theory
Representation theory
Group
Matrix
Icosahedron
Graph automorphism
Adjacency matrix
Symmetry
Geometry
Mathematics

Add to Reading List

Source URL: www.maths.lancs.ac.uk

Download Document from Source Website

File Size: 256,69 KB

Share Document on Facebook

Similar Documents

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

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

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

DocID: 1r7bO - View Document

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

DocID: 1r0gd - View Document

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

DocID: 1qTiS - View Document

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

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