Graphs, Dioids and Semirings New Models and Algorithms /

• Κύριοι συγγραφείς: Gondran, Michel (Συγγραφέας), Minoux, Michel (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Boston, MA : Springer US, 2008.
• Σειρά: Operations Research/Computer Science Interfaces, 41
• Θέματα: Mathematics.; Operations research.; Decision making.; Computer organization.; Computer science > Mathematics.; Mathematical models.; Management science.; Combinatorics.; Operations Research, Management Science.; Computer Systems Organization and Communication Networks.; Operation Research/Decision Theory.; Discrete Mathematics in Computer Science.; Mathematical Modeling and Industrial Mathematics.

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

Πίνακας περιεχομένων:

• 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.