Názov:Reducible Configurations for TSP on Subcubic Graphs
Vedúci:doc. RNDr. Robert Luko»ka, PhD.
Kµúčové slová:TSP, graphs, trees
Abstrakt:The goal of this thesis was to search for reductions on as of now untapped instances of subcubic graphs. The thesis is divided into 5 chapters. The first chapter serves as an introduction to the terminology used during in the text. The second chapter discusses the current state of the art in the saearch for faster solutions to graphic TSP problem. It also delves into the details of the construction of reductions, which are later used for testing purposes. The third chapter briefly discusses the overall plan for achieving our goals and the steps we set out to complete. The fourth chapter provides an extended look into the implementation of the needed program. The fifth, and final, chapter discusses the various experiments which have been conducted after we finished the implementation and testing of our program. 45 pages.

Súbory diplomovej práce:


Súbory prezentácie na obhajobe: