Hillel Romero-Monsivais

Learn More
The Cyclic Bandwidth problem (CB) for graphs consists in labeling the vertices of a guest graph G by distinct vertices of a host cycle C (both of order n) in such a way that the maximum distance in the cycle between adjacent vertices in G is minimized. The CB problem arises in application areas like VLSI designs, data structure representations and(More)
The Cyclic Bandwidth problem (CB) for graphs consists in labeling the vertices of a guest graph G by distinct vertices of a host cycle C n (both of order n) in such a way that the maximum distance in the cycle between adjacent vertices in G is minimized. To the best of our knowledge, this is the first research work investigating the use of metaheuristic(More)
Cryptosystems require the computation of modular expo-nentiation, this operation is related to the problem of finding a minimal addition chain. However, obtaining the shortest addition chain of length n is an NP-Complete problem whose search space size is proportional to n!. This paper introduces a novel idea to compute the minimal addition chain problem,(More)
  • 1