3 papers
cs.DS2011
Conauto-2.0: Fast Isomorphism Testing and Automorphism Group Computation
José Luis López-Presa, Antonio Fernández Anta, Luis Núñez Chiroque
In this paper we present an algorithm, called conauto-2.0, that can efficiently compute a set of generators of the automorphism group of a graph, and test whether two graphs are is…
cs.DC2011
Node Sampling using Random Centrifugal Walks
Andrés Sevilla, Alberto Mozo, Antonio Fernández Anta
Sampling a network with a given probability distribution has been identified as a useful operation. In this paper we propose distributed algorithms for sampling networks, so that n…
cs.DS2011
Fast Isomorphism Testing of Graphs with Regularly-Connected Components
Jose Luis Lopez-Presa, Antonio Fernandez Anta
The Graph Isomorphism problem has both theoretical and practical interest. In this paper we present an algorithm, called conauto-1.2, that efficiently tests whether two graphs are…