Matroids are a combinatorical structure, rst introduced by Hassler Whitney
in 1935, that generalizes and uses notions such as independent set, cycle,
base, rank function, minor, duality and others. Matroids can be dened in
dierent ways, mostly using terminology used in graph theory and linear
algebra. Based on the denition used, we can use matroids in a variety
of problems from the elds of combinatorics and optimization, such as the
packing and covering problems, as well as the greedy method.
|
