Combinatorial optimization: networks and matroids

🤖 Plain-English Summary

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.

🔑 Key Findings

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

💡 Why This Matters

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

Read the full paper
Access the original peer-reviewed research via OpenAlex.

View Original ↗

📜 Copyright Notice: This page shows only metadata (title, authors, journal, date) and an original AI-generated summary. No abstract or full article text is copied. The original research is the intellectual property of its authors and publisher. ScienceTrace does not reproduce copyrighted content.

← More Mathematics All Research Articles

📋 Article Details

Category	∑ Mathematics
Published	Aug 16, 2021
Journal	Research Journal
Authors	Eugene L. Lawler
Citations	3,375
Source	OpenAlex

🗂️ Research Categories

🤖 Artificial Intelligence 🧬 Medicine & Biology ⚛️ Physics & Space Science ⚙️ Engineering & Technology ∑ Mathematics