Graphs, dioids and semirings : new models and algorithms /

Saved in:
Bibliographic Details
Author / Creator:Gondran, Michel.
Imprint:New York : Springer, c2008.
Description:1 online resource (xix, 383 p.) : ill.
Language:English
Series:Operations research/computer science interfaces ; ORCS 41
Operations research/computer science interfaces series ; ORCS 41.
Subject:
Format: E-Resource Book
URL for this record:http://pi.lib.uchicago.edu/1001/cat/bib/8886290
Hidden Bibliographic Details
Other authors / contributors:Minoux, Michel.
ISBN:9780387754505
0387754504
9780387754499 (hbk.)
0387754490 (hbk.)
Notes:Includes bibliographical references and index.
Description based on print version record.
Summary: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 a" the 'Traveling Salesman Problem' -, is still the subject of active research. Yet, it has been during the last fifty years or soa "with the rise of the electronic computersa "that Graph theory has become an indispensable discipline in terms of the number and importance of its applications across the Applied Sciences. Gra.
Other form:Print version: Gondran, Michel. Graphs, dioids and semirings. New York : Springer, c2008 9780387754499 0387754490