Graphs, dioids and semirings: new models and algorithms

Graphs, dioids and semirings: new models and algorithms

Gondran, M.
Minoux, M.

119,55 €(IVA inc.)

The primary objectives of Graphs, Dioïds and Semiring: New Models and Algorithms are to emphasize the deep relations existing between the semiring and dioïd 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., dioïds), apart from the classical structures of groups, rings, and fields. A modern treatment of Graph Theory and its theoretical developments and recent algorithmatic applications INDICE: Pre-Semirings, Semirings and Dioïds.- Combinatorial Properties of (Pre-) Semirings.- Topology in Ordered Sets/ Topological Dioïds.- Solving Linear Systems in Dioïds.- Linear Dependence and Independence in Semi-Modules and Moduloïds.- Eigenvalues and Eigenvectors of Endomorphisms.- Dioïds and Nonlinear Analyses.- Collected Examples of Monoïds, (Pre-) Semirings and Dioïds.- Bibliography.- Index.

  • ISBN: 978-0-387-75449-9
  • Editorial: Springer
  • Encuadernacion: Cartoné
  • Páginas: 415
  • Fecha Publicación: 01/01/2008
  • Nº Volúmenes: 1
  • Idioma: Inglés