Ana Pavlišič (2009) A distributed algorithm for maximum triangle packing. EngD thesis.
In the introduction we define the maximum triangle packing optimization problem and situate it within a particular class of problems in the graph theory. We summarize presently existing solution and propose a distributed algorithm as one possible solution to the problem. We conclude the introductory part with the presentation of objectives of this work. We continue with pressuposed distributed model for which the algorithm should be functional and present the said distributed algorithm. Then follows the description of the implementation accompanied with the presentation of a toolkit for the simulation of distributed algorithms in Java that was used in the development of the algorithm and the description of the input parameters on which the developed program is being applied. Then we expose some of the most common problems, that we have faced during the process of algorithm development. Finally we present the results of the conducted measurements and evaluate the successfulness of the algorithm. We conclude with suggestions for future development, possible enhancements and with some conclusive discoveries.
Actions (login required)