Graphs, Dioids and Semirings New Models and Algorithms / by Michel Gondran, Michel Minoux.

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 'Traveli...

Full description

Saved in:
Bibliographic Details
Main Authors: Gondran, Michel (Author), Minoux, Michel (Author)
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: New York, NY : Springer US : Imprint: Springer, 2008.
Edition:1st ed. 2008.
Series:Operations Research/Computer Science Interfaces Series, 41
Springer eBook Collection.
Subjects:
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
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.