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 42252
.
.
Author info on Wikipedia
.
.
LibraryThing
.
.
Google Books
.
.
Amazon Books
.
Catalogue Information
Catalogue Record 42252
.
Reviews
Catalogue Record 42252
.
British Library
Resolver for RSN-42252
Google Scholar
Resolver for RSN-42252
WorldCat
Resolver for RSN-42252
Catalogo Nazionale SBN
Resolver for RSN-42252
GoogleBooks
Resolver for RSN-42252
ICTP Library
Resolver for RSN-42252
.
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)
Publication
Berlin, Heidelberg : : Springer Berlin Heidelberg : : Imprint: Springer, , 1999.
Physical Details
XII, 589 p. 8 illus. : online resource.
Series
Algorithms and computation in mathematics
1431-1550 ; ; 5
ISBN
9783662038222
Summary Note
From the reviews of the German edition: "Combinatorial optimization, along with graph algorithms and complexity theory is booming. This book treats the most prominent problems which are polynomially solvable. The Traveling Salesman Problem is discussed as a paradigm of an NP-complete problem. The text is well written, most exercises are quite enlightening and the hints are clear. Algorithms are described very thoroughly. The list of references is impressive and gives good guidance for further reading. The book can be recommended to beginners as an introductory text as well as for research and industry as a reference." (OPTIMA) In this corrected 2nd printing of the first edition the author has made some small modifications: some minor mistakes were corrected and updates to the bibliography provided.:
Contents note
1. Basic Graph Theory -- 2. Algorithms and Complexity -- 3. Shortest Paths -- 4. Spanning Trees -- 5. The Greedy Algorithm -- 6. Flows -- 7. Applications in Combinatorics -- 8. Colourings -- 9. Circulations -- 10. Synthesis of Networks -- 11. Connectivity -- 12. Matchings -- 13. Weighted Matchings -- 14. A Hard Problem: The TSP -- A. Solutions -- B. List of Symbols -- References.
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-662-03822-2
Links to Related Works
Subject References:
Combinatorics
.
Mathematics
.
Authors:
Jungnickel, Dieter
.
Corporate Authors:
SpringerLink (Online service)
.
Series:
Algorithms and computation in mathematics
.
Classification:
511.6
.
511.6 (DDC 21)
.
.
ISBD Display
Catalogue Record 42252
.
Tag Display
Catalogue Record 42252
.
Related Works
Catalogue Record 42252
.
Marc XML
Catalogue Record 42252
.
Add Title to Basket
Catalogue Record 42252
.
Catalogue Information 42252
Beginning of record
.
Catalogue Information 42252
Top of page
.
Download Title
Catalogue Record 42252
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
42252
1
42252
-
2
42252
-
3
42252
-
4
42252
-
5
42252
-
Quick Search
Search for