Please use this identifier to cite or link to this item:
http://hdl.handle.net/2445/185604
Title: | Algorismes i aplicacions d’aparellaments maximals en grafs |
Author: | Sabater Rojas, Lluı́s |
Director/Tutor: | Benseny, Antoni |
Keywords: | Algorismes computacionals Treballs de fi de grau Teoria de grafs Programació (Matemàtica) Computer algorithms Bachelor's theses Graph theory Mathematical programming |
Issue Date: | 20-Jun-2021 |
Abstract: | [en] The aim of the project is the study of maximal matchings in graphs, both in unweighted graphs and in weighted graphs. For the case of the graphs that are not weighted, we will see how Edmond's algorithm works, which will allows us to find a maximum cardinality matching. After studying the case without weights, we will introduce a few concepts of linear programming in order to be able to solve the weighted case, where we will look for maximum weight matchings. Finally, we will see the applications of these results when finding approximations (one upper bound and one lower bound) in polynomial time for the Travelling Salesman Problem, we will use Christofides’ algorithm to find an upper bound. |
Note: | Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2021, Director: Antoni Benseny |
URI: | http://hdl.handle.net/2445/185604 |
Appears in Collections: | Treballs Finals de Grau (TFG) - Matemàtiques |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
tfg_sabater_rojas_lluis.pdf | Memòria | 724.73 kB | Adobe PDF | View/Open |
This item is licensed under a Creative Commons License