Linked Data Explorer

"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."
"This text is aimed at anyone who has to teach combinatorial optimisation. It is very helpful for students, teachers, and researchers in this area. The author finds a synthesis of nice and interesting mathematical results and practical applications."@en
"Striking a synthesis between mathematical results and practical applications, this text covers topics in the fields of combinational optimisation along with graph algorithms and complexity theory."@en
"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 boo"@en
"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 2005 Once again, the new edition has been thoroughly revised. In particular, some further material has been added: more on NP-completeness (especially on dominating sets), a section on the Gallai-Edmonds structure theory for matchings, and about a dozen additional exercises - as always, with solutions. Moreover, the section on the 1-factor theorem has been completely rewritten: it now presents a short direct proof for the more general Berge-Tutte formula. Several recent research developments are discussed and quite a few references have been added."@en
"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."@en

genre

http://schema.org/genre

"Leermiddelen (vorm)"
"Lehrbuch"
"Libros electrónicos"
"Llibres electrònics"
"Electronic books"
"Electronic books"@en
"Online-Publikation"

name

http://schema.org/name

"Graphs, Networks and Algorithms"
"Graphs, Networks and Algorithms"@en
"Graphs, networks and algorithms : with 209 figures a. 9 tables"
"Graphs, networks and algorithms with 9 tables"
"Graphs, networks and algorithms"@en
"Graphs, networks and algorithms"
"Graphen, netzwerke und algorithmen"
"Graphs, networks, and algorithms"
"Graphs, networks, and algorithms"@en
"Graphs, networks and algorithms : with 9 tables"
"Graphen, Netzwerke und Algorithmen"
"Graphs, Networks and Algorythms"

workExample

http://schema.org/workExample