ARTÍCULO
TITULO

Some heuristics and results for small cycles of the discrete logarithm

Joshua Holden    
Pieter Moree     

Resumen

No disponible

 Artículos similares

       
 
Milos Seda    
The assignment problem is a problem that takes many forms in optimization and graph theory, and by changing some of the constraints or interpreting them differently and adding other constraints, it can be converted to routing, distribution, and schedulin... ver más
Revista: Algorithms

 
Dadmehr Rahbari    
In recent years, the increasing use of the Internet of Things (IoT) has generated excessive amounts of data. It is difficult to manage and control the volume of data used in cloud computing, and since cloud computing has problems with latency, lack of mo... ver más
Revista: Algorithms

 
Boris Melnikov,Yulia Terentyeva     Pág. 13 - 21
The paper deals with the development of the topology of ultra-large communication networks, i.e. networks containing several thousand vertices. In this case, the coordinates of the vertices of the undirected graph are somehow predetermined and a set of e... ver más

 
Sergey Kurapov,Maxim Davidovsky     Pág. 1 - 8
In general, a universal algorithm for testing a pair of graphs G and H for isomorphism exists. It is grounded on the fact that the rows and the corresponding columns of the adjacency matrix of the graph G can be rearranged until it turns into another, eq... ver más

 
José M. Villegas, Camilo Caraveo, David A. Mejía, José L. Rodríguez, Yuridia Vega, Leticia Cervantes and Alejandro Medina-Santiago    
The optimization is essential in the engineering area and, in conjunction with use of meta-heuristics, has had a great impact in recent years; this is because of its great precision in search of optimal parameters for the solution of problems. In this wo... ver más
Revista: Algorithms