Graphs, Dioids and Semirings New Models and Algorithms / by Michel Gondran, Michel Minoux.

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

Full description

Saved in:
Bibliographic Details
Main Authors: Gondran, Michel (Author), Minoux, Michel (Author)
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: New York, NY : Springer US : Imprint: Springer, 2008.
Edition:1st ed. 2008.
Series:Operations Research/Computer Science Interfaces Series, 41
Springer eBook Collection.
Subjects:
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.

MARC

LEADER 00000nam a22000005i 4500
001 b3331557
003 MWH
005 20191220130128.0
007 cr nn 008mamaa
008 100301s2008 xxu| s |||| 0|eng d
020 |a 9780387754505 
024 7 |a 10.1007/978-0-387-75450-5  |2 doi 
035 |a (DE-He213)978-0-387-75450-5 
050 4 |a E-Book 
072 7 |a KJT  |2 bicssc 
072 7 |a BUS049000  |2 bisacsh 
072 7 |a KJT  |2 thema 
072 7 |a KJM  |2 thema 
100 1 |a Gondran, Michel.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Graphs, Dioids and Semirings  |h [electronic resource] :  |b New Models and Algorithms /  |c by Michel Gondran, Michel Minoux. 
250 |a 1st ed. 2008. 
264 1 |a New York, NY :  |b Springer US :  |b Imprint: Springer,  |c 2008. 
300 |a XX, 388 p. 26 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Operations Research/Computer Science Interfaces Series,  |x 1387-666X ;  |v 41 
490 1 |a Springer eBook Collection 
505 0 |a 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. 
520 |a 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 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 |a Loaded electronically. 
590 |a Electronic access restricted to members of the Holy Cross Community. 
650 0 |a Operations research. 
650 0 |a Management science. 
650 0 |a Computer organization. 
650 0 |a Combinatorics. 
650 0 |a Decision making. 
650 0 |a Computer science—Mathematics. 
650 0 |a Mathematical models. 
690 |a Electronic resources (E-books) 
700 1 |a Minoux, Michel.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
830 0 |a Operations Research/Computer Science Interfaces Series,  |x 1387-666X ;  |v 41 
830 0 |a Springer eBook Collection. 
856 4 0 |u https://holycross.idm.oclc.org/login?auth=cas&url=https://doi.org/10.1007/978-0-387-75450-5  |3 Click to view e-book  |t 0 
907 |a .b33315577  |b 04-18-22  |c 02-26-20 
998 |a he  |b 02-26-20  |c m  |d @   |e -  |f eng  |g xxu  |h 0  |i 1 
912 |a ZDB-2-SMA 
950 |a Mathematics and Statistics (Springer-11649) 
902 |a springer purchased ebooks 
903 |a SEB-COLL 
945 |f  - -   |g 1  |h 0  |j  - -   |k  - -   |l he   |o -  |p $0.00  |q -  |r -  |s b   |t 38  |u 0  |v 0  |w 0  |x 0  |y .i22447192  |z 02-26-20 
999 f f |i df005580-f7e8-5bc2-8d81-ccd053e497e7  |s adceed10-3976-5175-aafe-da4eeebc0db9  |t 0 
952 f f |p Online  |a College of the Holy Cross  |b Main Campus  |c E-Resources  |d Online  |t 0  |e E-Book  |h Library of Congress classification  |i Elec File