Tell your friends about this item:
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
| Media | Books Paperback Book (Book with soft cover and glued back) |
| Released | April 13, 1988 |
| ISBN13 | 9783540189695 |
| Publishers | Springer-Verlag Berlin and Heidelberg Gm |
| Pages | 315 |
| Dimensions | 152 × 229 × 18 mm · 439 g |
| Language | English |
More by Ulrich Derigs
Show allMere med samme udgiver
See all of Ulrich Derigs ( e.g. Paperback Book and Hardcover Book )