Home > Search Results: recid:499169
Search:
 
Search Tips :: Simple Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 1 records found  Search took 0.00 seconds. 

Warning: Requested record does not seem to exist.
Integer programming and its applications
 Eliáš, Marek ; Pergel, Martin (advisor) ; Hladík, Milan (referee)
In this thesis we present and implement several graph algorithms. In the rst part, we discus algorithm for the minimum weighted perfect matching in bipartite and general graphs based on the primal-dual method and their modi cations. In the second part, there are algorithms for the max-cut in planar graphs and Christo des' heuristic for TSP. We present full descriptions of these algorithms providing either proof of correctness or reference to the literature. The last part deals with two approaches which we use to visualise these algorithms with di erent degree of interactivity both allowing custom graph on input.
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English