Articoli correlati a Combinatorial Optimization: Networks and Matroids
Combinatorial Optimization: Networks and Matroids - Rilegato
Libro 145 di 303: Dover Books on Mathematics
Sinossi
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. A suitable text or reference for courses in combinatorial computing and concrete computational complexity in departments of computer science and mathematics.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.