Graphs, dioids and semi-rings. New models and algorithms (Q2781754)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Graphs, dioids and semi-rings. New models and algorithms |
scientific article; zbMATH DE number 1726527
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graphs, dioids and semi-rings. New models and algorithms |
scientific article; zbMATH DE number 1726527 |
Statements
10 April 2002
0 references
graphs
0 references
dioids
0 references
semirings
0 references
moduloids
0 references
Graphs, dioids and semi-rings. New models and algorithms (English)
0 references
This book is essentially about graphs, dioids and semirings. It is divided into 8 chapters. Chapter 1 introduces the notations and basic concepts: pre-semirings, semirings, and dioids. Chapter 2 discusses the combinatorial properties of pre-semirings. Chapter 3 is about topologies on ordered sets and topological dioids. Chapter 4 is concerned with the resolution of linear systems in the framework of dioids theory. Chapter 5 is about dependence and linear independence concepts within the framework of semi-moduloids and moduloids. Chapter 6 deals with eigenvalues and eigenvectors of endomorphisms. Chapter 7 focusses on the relation between dioids theory and classical nonlinear analysis. Finally, Chapter 8 displays a manifold of interesting examples of semirings and dioids.NEWLINENEWLINENEWLINEThis book is addressed to advanced students and researchers working in areas like operations research, nonlinear analysis, and max-plus algebra.
0 references
