Matroid Theory and its Applications pp 125-275
The Tutte Polynomial Part I: General Theory
Matroid theory (sometimes viewed as the theory of combinatorial geometries or geometric lattices) is reasonably young as a mathematical theory (its traditional birthday is given as 1935 with the appearance of ) but has steadily developed over the years and shown accelerated growth recently due, in large part, to two applications. The first is in the field of algorithms. To coin an oversimplification: “when a good algorithm is known, a matroid structure is probably hidden away somewhere.” In any event, many of the standard good algorithms (such as the greedy algorithm) and many important ones whose complexities are currently being scrutinized (e.g., existence of a Hamiltonian path) can be thought of as matroid algorithms. In the accompanying lecture notes of Professor Welsh the connections between matroids and algorithms are presented.
Unable to display preview. Download preview PDF.