Graphs, networks and algorithms [Documento eletrónico] / Dieter Jungnickel
Language: eng.Country: US - United States of America.Publication: Berlin, Heidelberg : Springer , 2005Description: XVI, 612 p. : il.ISBN: 978-3-540-26908-3.Series: Algorithms and Computation in Mathematics, 5Subject - Topical Name: Optimização combinatória | Teoria dos grafos Online Resources:Click here to access onlineItem type | Current library | Collection | Call number | Copy number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|---|---|
E-Books | Biblioteca NOVA FCT Online | Não Ficção | QA402.5.SPR. FCT 94378 (Browse shelf(Opens below)) | 1 | Available |
Browsing Biblioteca NOVA FCT shelves, Shelving location: Online, Collection: Não Ficção Close shelf browser (Hides shelf browser)
QE33.2.SPR. FCT 94376 Space, structure and randomness, contributions in honor of Georges Matheron in the field of geostatistics, random sets and mathematical morphology | QA641.SPR. FCT 94375 Complex geometry, an introduction | QA313.SPR. FCT 94377 Computational ergodic theory | QA402.5.SPR. FCT 94378 Graphs, networks and algorithms | QA273.SPR. FCT 94379 Séminaire de probabilités XXXVIII | QA155.SPR. FCT 94381 Algebra and number theory, proceedings of the silver jubilee conference University of Hyderabad | QA21.SPR. FCT 94382 Contributions to the history of indian mathematics |
Colocação: Online
From the reviews of the first edition: ".... The book is a first class textbook and seems to be indispensable for everybody who has to teach combinatorial optimization. It is very helpful for students, teachers, and researchers in this area. The author finds a striking synthesis of nice and interesting mathematical results and practical applications. ... the author pays much attention to the inclusion of well-chosen exercises. The reader does not remain helpless; solutions or at least hints are given in the appendix. Except for some small basic mathematical and algorithmic knowledge the book is self-contained. ..." Mathematical Reviews 2002 This thoroughly revised new edition offers a new chapter on the network simplex algorithm and a section on the five color theorem. Moreover, numerous smaller changes and corrections have been made and several recent developments have been discussed and referenced.
There are no comments on this title.