Abstract: The Traveling Salesman Problem (TSP) is a challenging combinatorial optimization problem classified as NP-hard. This paper investigates the performance of various meta-heuristic algorithms, ...

This package implements python bindings for the ORbit Counting Algorithm. The original source code was modified to avoid memory leaks upon repeated function calls and allow for parallel orbit counting ...

Abstract: The influence maximization problem in graphstructured social networks is to identify the most influential node set in the graph to enable widespread information dissemination. We propose a ...