Pastāsti draugiem par šo preci:
Programming in Networks and Graphs: On the Combinatorial Background and Near-Equivalence of Network Flow and Matching Algorithms - Lecture Notes in Economics and Mathematical Systems Ulrich Derigs
Programming in Networks and Graphs: On the Combinatorial Background and Near-Equivalence of Network Flow and Matching Algorithms - Lecture Notes in Economics and Mathematical Systems
Ulrich Derigs
It is then shown that they all reduce to a common basic principle, that is, they all perform the same computational steps if certain conditions are set properly and ties are broken according to a common rule.
326 pages, biography
| Mediji | Grāmatas Paperback Book (Grāmata ar mīksto vāku un līmēto muguru) |
| Izlaists | 1988. gada 13. aprīlis |
| ISBN13 | 9783540189695 |
| Izdevēji | Springer-Verlag Berlin and Heidelberg Gm |
| Lapas | 315 |
| Izmēri | 152 × 229 × 18 mm · 439 g |
| Valoda | Angļu |