Descripción
|
|
---|---|
Graph automorphism (GA) is a classical problem, in which the objective is to compute the automorphism group of an input graph. In this work we propose four novel techniques to speed up algorithms that solve the GA problem by exploring a search tree. They increase the performance of the algorithm by allowing to reduce the depth of the search tree, and by effectively pruning it. We formally prove that a GA algorithm that uses these techniques correctly computes the automorphism group of the input graph. | |
Internacional
|
Si |
Nombre congreso
|
Experimental Algorithms, 12th International Symposium, SEA 2013 |
Tipo de participación
|
960 |
Lugar del congreso
|
Roma, Italia |
Revisores
|
Si |
ISBN o ISSN
|
978-3-642-38526-1 |
DOI
|
10.1007/978-3-642-38527-8_27 |
Fecha inicio congreso
|
05/06/2013 |
Fecha fin congreso
|
07/06/2013 |
Desde la página
|
296 |
Hasta la página
|
307 |
Título de las actas
|
Experimental Algorithms, 12th International Symposium, SEA 2013, Rome, Italy, June 5-7, 2013. Proceedings |