Repository of scripts and data for the "Robustness and resilience of complex networks" paper by Oriol Artime, Marco Grassia, Manlio De Domenico, James P. Gleeson, Hernán A. Makse, Giuseppe Mangioni, Matjaž Perc and Filippo Radicchi, published at Nature Review Physics (2024). https://doi.org/10.1038/s42254-023-00676-y

Записките ми за упражнения по "Дизайн и анализ на алгоритми"

An implementation of an A* Informed Search Algorithm for solving the N-Puzzle problem, using several heuristic functions, written in C

Comparative Analysis of Solutions to the NP-hard Problem: Travelling Salesman Problem.

Traveling Salesman Problem - Explore various algorithms, approximations, and heuristics, aiming to find the most efficient and accurate solution in terms of time and results

Ant Colony Optimization algorithm solving Google HashCode 2020 online elimination problem

Na Rinha de Algoritmos você deve utilizar suas habilidades para a criação de algoritmos eficientes para resolver problemas!

Computer Science 170: Efficient Algorithms and Intractable Problems

A local search algorithm to solve the Minimum-Weighted Vertex Cover (MWVC) problem.

A program that breaks cycles in undirected and directed graphs (with and without weights), that is, to find the minimum feedback arc set in given graphs.

Trying to find a maximum clique in a Graph

Y.Neo Graph のイメージ (publish in 2002, 2023(the code))

Heuristics and metaheuristics for enhancing Run-Length Encoding in a database

A Quantum Approximation algorithm for finding the Max-Cut of directed weighted graphs.

Implementation of the Simulated Annealing (SA) algorithm to tactically solve the Traveling. The project involves constructing an adjacency matrix to model inter-city distances, iteratively refining solutions through stochastic alterations influenced by a dynamically adjusted temperature parameter, and employing the Metropolis acceptance criterion.

Official Implementation of the NeurIPS'23 paper 'Maximum Independent Set: Self-Training through Dynamic Programming'.

A List of Papers on Theoretical Foundations of Graph Neural Networks

OptaPy is an AI constraint solver for Python to optimize planning and scheduling problems.

Repository of the paper "CoreGDM: Geometric Deep Learning Network Decycling and Dismantling" by M. Grassia and G. Mangioni

Russian Doll Search for Computing Maximum Vertex Weight Hereditary Structures in Graphs. Now with OpenMP support.