Luis F. Chiroque

Learn More
Graph automorphism (GA) is a classical problem, in which the objective is to compute the automorphism group of an input graph. Most GA algorithms explore a search tree using the individualization-refinement procedure. Four novel techniques are proposed which increase the performance of any algorithm of this type by reducing the depth of the search tree and(More)
Building complex simulations is usually a challenge, mainly due to the broad spectrum of concepts that must be taken into account. Simulation middleware based on the IEEE 1516 standard tries to reduce this complexity, but there are still aspects that hinder the implementation of such simulations. The dependency between the source code and the corresponding(More)
  • 1