In this project we are comparing two approaches for movie recommendation for a new user or existing user based on their age, gender, occupation.

Algorithm to find communities in a graph.

Linux release and dataset of instances tested of the new algorithm Bfilt for Binary Constraint Satisfaction Problems. The new algorithm improves over the state-of-the-art approaches.

Comprehensive analysis of the NP-Complete problem k-Clique

Este repositorio es una colección de algoritmos de grafos que abordan diversos problemas, incluyendo la detección de comunidades en redes, la búsqueda de la ruta más corta y la identificación de cubiertas de k-cliques.