Matroids provide a successful connection between graph theory, geometry and linear algebra. Some of the dualities we will discuss later are rooted in the theory of matroids. Moreover, matroids provide a basis for discrete optimization. Several important algorithms, for instance the greedy algorithm, belong to the matroid world. We make a notational agreement in this chapter: the graphs are allowed to have loops and multiple edges.
KeywordsGreedy Algorithm Rank Function Maximal Subset Minimum Span Tree Problem Matroid Intersection
Unable to display preview. Download preview PDF.