Paths, Trees, and Flowers presentation

Matching in graphs is a subset of edges with no shared endpoints. and a maximum matching is a matching of maximum size among all matchings in a given graph.

Edmonds represented the first such algorithm in his famous paper "Paths, Trees, and Flowers" in 1965.

PathsTreesAndFlowers.pdf

PathsTreesAndFlowers.tex

clrscode3e.sty