Combinatorial optimization: networks and matroids

Perceptively written text examines optimization problems that can be formulated in terms of networks and algebraic structures called matroids. Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems.

⚡ This is an original paraphrased summary — not copied from the abstract. Full paper available at the source link below.

• 1 Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems.
• 2 A suitable text or reference for courses in combinatorial computing and concrete computational complexity in departments of computer science and mathematics.

Mathematical breakthroughs form the theoretical backbone of science, cryptography, data analysis, and engineering.

This summary is based on publicly available metadata and abstract. For the full research paper, visit the original source: