Milan E. Soklic

Learn More
The problem of coloring graph vertices, known to be NP-complete, is discussed. We present an alternative solution to this problem as a distributed simulation which uses a parallel randomized heuristic algorithm for making local decisions to color graph vertices. The algorithm is based on an inter-particle system from statistical mechanics. Since the(More)
This article discusses a serial and a parallel version of a heuristic algorithm for a solution to the traveling salesman problem, implementation of these algorithms, and their performance in terms of finding the most favorable solution, and an average solution. The algorithms implemented in C sequential programming language, and in Occam concurrent(More)
  • 1