Tobias Nipkow
2018-11-20 18:20:29 UTC
Matroids
Jonas Keinholz
This article defines the combinatorial structures known as Independence Systems
and Matroids and provides basic concepts and theorems related to them. These
structures play an important role in combinatorial optimisation, e. g. greedy
algorithms such as Kruskal's algorithm. The development is based on Oxley's
`What is a Matroid?'.
Enjoy!
Jonas Keinholz
This article defines the combinatorial structures known as Independence Systems
and Matroids and provides basic concepts and theorems related to them. These
structures play an important role in combinatorial optimisation, e. g. greedy
algorithms such as Kruskal's algorithm. The development is based on Oxley's
`What is a Matroid?'.
Enjoy!