Graph automorphism

Results: 31



#Item
1Graph 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

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

Add to Reading List

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

Language: English - Date: 2016-07-30 09:35:21
2Permutation 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

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

Language: English - Date: 2016-07-30 09:35:21
3TSPLIB 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

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

Add to Reading List

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

Language: English - Date: 2013-06-19 04:16:58
4TSPLIB 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

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

Add to Reading List

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

Language: English - Date: 2013-06-19 04:16:58
5Graph 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

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

Add to Reading List

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

Language: English - Date: 2016-07-30 09:35:21
6Symmetry Detection in General Game Playing Stephan Schiffel Department of Computer Science Dresden University of Technology

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

Add to Reading List

Source URL: ggp.stanford.edu

Language: English - Date: 2009-05-18 11:49:39
7Representing 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

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

Add to Reading List

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

Language: English - Date: 2016-07-30 09:35:21
8Automorphism 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

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

Add to Reading List

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

Language: English - Date: 2014-07-28 11:54:50
    9Abstract Alexander Ivanov Imperial College London Let G be a subgroup in the automorphism group of a graph X. The action of G on X

    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

    Add to Reading List

    Source URL: math.ipm.ac.ir

    - Date: 2015-03-03 06:55:35
      10GAP Exercises Version 1.0 February 17, 2010 Stefan Kohl

      GAP Exercises Version 1.0 February 17, 2010 Stefan Kohl

      Add to Reading List

      Source URL: www.gap-system.org

      Language: English - Date: 2011-12-29 17:52:06