Pastāsti draugiem par šo preci:
Combinatorial Optimization: Networks and Matroids (Dover Books on Mathematics) Reprint edition
Combinatorial Optimization: Networks and Matroids (Dover Books on Mathematics)
Mathematics
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.
| Mediji | Grāmatas Paperback Book (Grāmata ar mīksto vāku un līmēto muguru) |
| Izlaists | 2011. gada 10. novembris |
| ISBN13 | 9780486414539 |
| Izdevēji | Dover Publications |
| Lapas | 384 |
| Izmēri | 140 × 220 × 20 mm · 403 g |
| Valoda | Angļu |
Vairāk no Mathematics
Rādīt visuVairāk no tā paša izdevēja
Skatīt visus Mathematics ( piem., Paperback Book , CD , Hardcover Book , 12" un LP )