Graphs, dioids and semirings : new models and algorithms
Author(s)
Bibliographic Information
Graphs, dioids and semirings : new models and algorithms
（Operations research/computer science interface series, 41）
Springer, c2008
- e
Available at / 9 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
GON||9||1200006834877
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references and index
Description and Table of Contents
Description
The primary objective of this essential text is to emphasize the deep relations existing between the semiring and dioid 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.
Table of Contents
Pre-Semirings, Semirings and Dioids.- Combinatorial Properties of (Pre)-Semirings.- Topology on Ordered Sets: Topological Dioids.- Solving Linear Systems in Dioids.- Linear Dependence and Independence in Semi-Modules and Moduloids.- Eigenvalues and Eigenvectors of Endomorphisms.- Dioids and Nonlinear Analysis.- Collected Examples of Monoids, (Pre)-Semirings and Dioids.
by "Nielsen BookData"
