Document type
Bachelor thesisPublication date
Publication license
Please use this identifier to cite or link to this item: https://hdl.handle.net/2445/185604
Algorismes i aplicacions d’aparellaments maximals en grafs
Journal Title
Authors
Director/Tutor
Additional contribution
Journal ISSN
Volume Title
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.
Description
Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2021, Director: Antoni Benseny
Related resource
Subject (English)
Citation
Collections
Citation
SABATER ROJAS, Lluı́s. Algorismes i aplicacions d’aparellaments maximals en grafs. [consulted: 13 of October of 2026]. Available at: https://hdl.handle.net/2445/185604