Combinatorial Optimization Networks and Matroids

Perceptivelywrittentextexaminesoptimizationproblemsthatcanbeformulatedintermsofnetworksandalgebraicstructurescalledmatroids.Chapterscovershortestpaths，networkflows，bipartitematching，nonbipartitematching，matroidsandthegreedyalgorithm，matroidintersections，andthematroidparityproblems.Asuitabletextorreferenceforcoursesincombinatorialcomputingandconcretecomputationalcomplexityindepartmentsofcomputerscienceandmathematics.