Descriere
:
Cumpara combinatorial optimization: networks dover publications de calitate.
Pe yeo poti sa gasesti cel mai bun pret pentru combinatorial optimization: networks dover publications
Perceptively written text examines optimization problems that can be formulated in terms of Networks and algebraic structures called matroids.
A suitable text or reference for courses in Combinatorial computing and concrete computational complexity in departments of computer science and mathematics..
Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, Matroids and the greedy algorithm, matroid intersections, and the matroid parity problems.
Perceptively written text examines optimization problems that can be formulated in terms of Networks and algebraic structures called matroids
Uneori, aceste descrieri pot contine inadvertente. De asemenea, imaginea este informativa si poate contine accesorii neincluse in pachetele standard.
