Graphs, Dioids and Semirings: New Models and Algorithms (Operations Research/Computer Science Interfaces Series, 41)

Gondran, Michel; Minoux, Michel

ISBN 10: 1441945296 / ISBN 13: 9781441945297

Editore: Springer, 2010

Riguardo questo articolo

Codice articolo ABLIING23Mar2411530295981

Dati bibliografici

• Titolo: Graphs, Dioids and Semirings: New Models and Algorithms (Operations Research/Computer Science Interfaces Series, 41)
• Editore: Springer
• Data di pubblicazione: 2010
• Lingua: Inglese
• ISBN 10: 1441945296
• ISBN 13: 9781441945297
• Rilegatura: Brossura
• Condizione: New

Descrizione articolo

Riassunto

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.

Dalla quarta di copertina

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.