Shortcuts
Top of page (Alt+0)
Page content (Alt+9)
Page menu (Alt+8)
Your browser does not support javascript, some WebOpac functionallity will not be available.
.
Default
.
PageMenu
-
Main Menu
-
Simple Search
.
Advanced Search
.
Journal Search
.
Refine Search Results
.
Preferences
.
Search Menu
Simple Search
.
Advanced Search
.
New Items Search
.
Journal Search
.
Refine Search Results
.
Bottom Menu
Help
Italian
.
English
.
German
.
New Item Menu
New Items Search
.
New Items List
.
Links
SISSA Library
.
ICTP library
.
Italian National web catalog (SBN)
.
Trieste University web catalog
.
Udine University web catalog
.
© LIBERO v6.4.1sp220816
Page content
You are here
:
Catalogue Display
Catalogue Display
Graphs, Networks and Algorithms
.
Bookmark this Record
Catalogue Record 27252
.
.
Author info on Wikipedia
.
.
LibraryThing
.
.
Google Books
.
.
Amazon Books
.
Catalogue Information
Catalogue Record 27252
.
Reviews
Catalogue Record 27252
.
British Library
Resolver for RSN-27252
Google Scholar
Resolver for RSN-27252
WorldCat
Resolver for RSN-27252
Catalogo Nazionale SBN
Resolver for RSN-27252
GoogleBooks
Resolver for RSN-27252
ICTP Library
Resolver for RSN-27252
.
Share Link
Jump to link
Catalogue Information
Field name
Details
Dewey Class
511.6
Title
Graphs, Networks and Algorithms ([Ebook]) / by Dieter Jungnickel.
Author
Jungnickel, Dieter
Other name(s)
SpringerLink (Online service)
Edition statement
3rd ed.
Publication
Berlin, Heidelberg : Springer , 2008.
Physical Details
XX, 650 pages 209 illus. : online resource.
Series
Algorithms and computation in mathematics
1431-1550 ; ; 5
ISBN
9783540727804
Summary Note
From the reviews of the previous editions ".... 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. ..." K.Engel, Mathematical Reviews 2002 The substantial development effort of this text, involving multiple editions and trailing in the context of various workshops, university courses and seminar series, clearly shows through in this new edition with its clear writing, good organisation, comprehensive coverage of essential theory, and well-chosen applications. The proofs of important results and the representation of key algorithms in a Pascal-like notation allow this book to be used in a high-level undergraduate or low-level graduate course on graph theory, combinatorial optimization or computer science algorithms. The well-worked solutions to exercises are a real bonus for self study by students. The book is highly recommended. P .B. Gibbons, Zentralblatt für Mathematik 1061, 2005 The third edition of this standard textbook contains additional material: two new application sections (on graphical codes and their decoding) and about two dozen further exercises (with solutions, as throughout the text). Moreover, recent developments have been discussed and referenced, in particular for the travelling salesman problem. The presentation has been improved in many places (for instance, in the chapters on shortest paths and on colorings), and a number of proofs have been reorganized, making them more precise or more transparent.:
Contents note
Prefaces -- Basic Graph Theory -- Algorithms and Complexity -- Shortest Paths -- Spanning Trees -- The Greedy Algorithm -- Flows -- Combinatorial Applications -- Connectivity and Depth First Search -- Colorings -- Circulations -- The Network Simplex Algorithm -- Synthesis of Networks -- Matchings -- Weighted Matchings -- A Hard Problem: The TSP -- Appendix A: Some NP-Complete Problems -- Appendix B: Solutions -- Appendix C: List of Symbols -- References -- Index.
System details note
Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users).
Internet Site
http://dx.doi.org/10.1007/978-3-540-72780-4
Links to Related Works
Subject References:
Algorithms
.
Combinatorics
.
Computer Science
.
Graph Theory
.
Mathematical optimization
.
Mathematics of Computing
.
Optimization
.
Authors:
Jungnickel, Dieter
.
Corporate Authors:
SpringerLink (Online service)
.
Series:
Algorithms and computation in mathematics
.
Classification:
511.6
.
511.6 (DDC 22)
.
.
ISBD Display
Catalogue Record 27252
.
Tag Display
Catalogue Record 27252
.
Related Works
Catalogue Record 27252
.
Marc XML
Catalogue Record 27252
.
Add Title to Basket
Catalogue Record 27252
.
Catalogue Information 27252
Beginning of record
.
Catalogue Information 27252
Top of page
.
Download Title
Catalogue Record 27252
Export
This Record
As
Labelled Format
Bibliographic Format
ISBD Format
MARC Format
MARC Binary Format
MARCXML Format
User-Defined Format:
Title
Author
Series
Publication Details
Subject
To
File
Email
Reviews
This item has not been rated.
Add a Review and/or Rating
27252
1
27252
-
2
27252
-
3
27252
-
4
27252
-
5
27252
-
Quick Search
Search for