4 research outputs found
Studying the effects of instance structure in algorithm performance
the amount of resources consumed in the worst case. However, it has become evident that the instance size by itself is an insufficient measure and that the worst-case scenario is often unin-formative in practice. As a complementary analysis, we propose the examination of structural properties present in the instances and the effects they have on algorithm performance; our goal is to characterize complexity in terms of instance structure. We propose a framework for identifying and characterizing hard instances based on algorithm behaviour as well as a case study applying the framework on the graph coloring problem
Complejidad computacional estructural en redes complejas.
El desarrollo del presente trabajo se enfoca en
estudiar el efecto de la estructura de instancias en la complejidad computacional al resolver un problema. Para realizar este trabajo, se acota la poblaci麓on de estudio a instancias
de problemas computacionales relacionados con grafos, espec麓谋ficamente al problema de
k-coloreo. Esto no es impedimento para que el estudio se extienda a otros problemas
computacionales, gracias a las reducciones que se pueden realizar entre problemas