Graphs, dioids and semirings

By Michel Gondran

Subjects: Dioid, Computational complexity, Operations research, Mathematics, Halbring, Combinatorics, Operations Research/Decision Theory, Semirings (Mathematics), Computer network architectures, Graph theory, Graph, Rings (algebra), Mathematical Programming Operations Research, Mathematical Modeling and Industrial Mathematics, Discrete Mathematics in Computer Science, Computer Systems Organization and Communication Networks

Description: "The primary objective of Graphs, Dioids and Semirings: New Models and Algorithms is to emphasize the deep relationship existing between the semiring and dioid structures with graphs and their combinatorial properties, while demonstrating the modeling and problem-solving capability and 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 (i.e., semirings), or correspond to a new branch of algebra (i.e., dioids), apart from the classical structures of groups, rings, and fields."--Jacket.