Graphs, Dioids and Semirings [electronic resource] : New Models and Algorithms / by Michel Gondran, Michel Minoux.

Por: Gondran, Michel [author.]Colaborador(es): Minoux, Michel [author.]Tipo de material: TextoTextoSeries Operations Research/Computer Science Interfaces, 41Editor: Boston, MA : Springer US, 2008Descripción: online resourceTipo de contenido: text Tipo de medio: computer Tipo de portador: online resourceISBN: 9780387754505Trabajos contenidos: SpringerLink (Online service)Tema(s): Mathematics | Computer network architectures | Computational complexity | Combinatorics | Operations research | Mathematics | Operations Research, Mathematical Programming | Computer Systems Organization and Communication Networks | Combinatorics | Operations Research/Decision Theory | Discrete Mathematics in Computer Science | Mathematical Modeling and Industrial MathematicsFormatos físicos adicionales: Sin títuloClasificación CDD: 519.6 Clasificación LoC:QA402-402.37T57.6-57.97Recursos en línea: de clik aquí para ver el libro electrónico
Contenidos:
Springer eBooksResumen: 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 sowith the rise of the electronic computersthat 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, DIODS 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.
Etiquetas de esta biblioteca: No hay etiquetas de esta biblioteca para este título. Ingresar para agregar etiquetas.
    Valoración media: 0.0 (0 votos)
No hay ítems correspondientes a este registro

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.

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 sowith the rise of the electronic computersthat 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, DIODS 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.

ZDB-2-SMA

No hay comentarios en este titulo.

para colocar un comentario.