Amazon cover image
Image from Amazon.com
Image from OpenLibrary

Graphs, Dioids and Semirings [electronic resource]: New Models and Algorithms/ by Michel Gondran, Michel Minoux.

By: Contributor(s): Series: Operations Research/Computer Science Interfaces ; 41Publication details: Boston: Springer US, 2008.Description: digitalISBN:
  • 9780387754505
Subject(s): Additional physical formats: Printed edition:: No titleDDC classification:
  • 519.6
Online resources:
Contents:
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 .
In: Springer eBooksSummary: The origins of Graph Theory date back to Euler (1736) with the solution of the celebrated 'Koenigsberg Bridges Problem'; and to Hamilton with the famous 'Trip around the World' game (1859), stating for the first time a problem which, in its most recent version – the 'Traveling Salesman Problem' -, is still the subject of active research. Yet, it has been during the last fifty years or so—with the rise of the electronic computers—that Graph theory has become an indispensable discipline in terms of the number and importance of its applications across the Applied Sciences. Graph theory has been especially central to Theoretical and Algorithmic Computer Science, and Automatic Control, Systems Optimization, Economy and Operations Research, Data Analysis in the Engineering Sciences. Close connections between graphs and algebraic structures have been widely used in the analysis and implementation of efficient algorithms for many problems, for example: transportation network optimization, telecommunication network optimization and planning, optimization in scheduling and production systems, etc. The primary objectives of GRAPHS, DIOÏDS AND SEMIRINGS: 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 .
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
No physical items for this record

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 .

The origins of Graph Theory date back to Euler (1736) with the solution of the celebrated 'Koenigsberg Bridges Problem'; and to Hamilton with the famous 'Trip around the World' game (1859), stating for the first time a problem which, in its most recent version – the 'Traveling Salesman Problem' -, is still the subject of active research. Yet, it has been during the last fifty years or so—with the rise of the electronic computers—that Graph theory has become an indispensable discipline in terms of the number and importance of its applications across the Applied Sciences. Graph theory has been especially central to Theoretical and Algorithmic Computer Science, and Automatic Control, Systems Optimization, Economy and Operations Research, Data Analysis in the Engineering Sciences. Close connections between graphs and algebraic structures have been widely used in the analysis and implementation of efficient algorithms for many problems, for example: transportation network optimization, telecommunication network optimization and planning, optimization in scheduling and production systems, etc. The primary objectives of GRAPHS, DIOÏDS AND SEMIRINGS: 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 .

There are no comments on this title.

to post a comment.
© 2023 IMPA Library | Customized & Maintained by Sérgio Pilotto


Powered by Koha