Graphs, Dioids and Semirings: New Models and Algorithms (Operations Research/Computer Science Interfaces Series)
|Rating||:||4.73 (537 Votes)|
|Number of Pages||:||388 Pages|
recommend this as a book to be added in the libraries of institutions where graduate courses in OR are taught, because it may provide ideas for PhD students and others to explore further the concepts developed in this book … ." (R Bharath, Journal of the Operational Research Society, Vol. From the reviews: "The authors carefully explain with examples what is meant by a canonically ordered monoid, semiring and dioid, and go on to show in the book the relevance of these algebraic structures to such classic operations research problems related to graphs and networks … . 60, 2009)
The primary objective of this essential text is to emphasize the deep relations existing between the semiring and dioïd structures with graphs and their combinatorial properties. It does so at the same time as demonstrating the modeling and problem-solving flexibility of these structures. In addition the book provides an extensive overview of the mathematical properties employed by "nonclassical" algebraic structures which either extend usual algebra or form a new branch of it.
Graphs, Diodes and rerererere I like this book. The content is excellent -- something most computer scientists should read if they get the chance. Unfortunately, its overshadowed by the poor printing of the copy I received. The type is grainy and pale, and I find it hard to read. Its not my particular copy, as Amazon were kind enough to let me exchange it, and the new copy is just as bad. And Springer wouldn't respond to attempts to ask them about the problem. Its pretty a pretty disappointing attitude to take w