000 03652nam a22003855i 4500
001 279246
003 MX-SnUAN
005 20170705134201.0
007 cr nn 008mamaa
008 150903s2008 xxu| o |||| 0|eng d
020 _a9780387754505
_99780387754505
024 7 _a10.1007/9780387754505
_2doi
035 _avtls000332591
039 9 _a201509030231
_bVLOAD
_c201404122207
_dVLOAD
_c201404091937
_dVLOAD
_y201402041033
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA402-402.37
100 1 _aGondran, Michel.
_eautor
_9303465
245 1 0 _aGraphs, Dioids and Semirings :
_bNew Models and Algorithms /
_cby Michel Gondran, Michel Minoux.
264 1 _aBoston, MA :
_bSpringer US,
_c2008.
300 _brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
490 0 _aOperations Research/Computer Science Interfaces,
_x1387-666X ;
_v41
500 _aSpringer eBooks
505 0 _aPre-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.
520 _aThe 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 so—with the rise of the electronic computers—that 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, DIOÏDS 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.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700 1 _aMinoux, Michel.
_eautor
_9303466
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9780387754499
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-0-387-75450-5
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c279246
_d279246