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.


Greedy Algorithm Rank Function Maximal Subset Minimum Span Tree Problem Matroid Intersection 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Vieweg+Teubner | GWV Fachverlage GmbH 2010

Authors and Affiliations

  • Martin Loebl
    • 1
  1. 1.Department of Applied Mathematics, Institut of Theoretical Computer ScienceCharles UniversityPrahaTschechische Republik

Personalised recommendations