Graphs, Dioids and Semirings : New Models and Algorithms
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...
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Livre numérique |
| Langue: | Anglais |
| Publié: |
New York, NY :
Springer US
2008.
Cham : Springer Nature |
| Collection: | Operations Research/Computer Science Interfaces Series
41 |
| Sujets: | |
| Accès en ligne: | Accès sur la plateforme de l'éditeur Accès sur la plateforme de l'éditeur (Springer) Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Graphs, Dioids and Semirings, Texte imprimé, 9780387523200 • Graphs, Dioids and Semirings, Texte imprimé, 9781441945297 • Graphs, dioids and semirings, new models and algorithms, Michel Gondran and Michel Minoux, New York, Springer, 2008, 1 vol. (xix-383 p.), Operations research/computer science interfaces, 978-0-387-75449-9 |
Table des matières:
- 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.