Algorithms and Computation in Mathematics - Graphs, Networks and Algorithms Ebook Tooltip

Afbeeldingen

Artikel vergelijken

  • Engels
  • E-book
  • 9783642322785
  • 08 november 2012
  • Adobe ePub
Alle productspecificaties
  • Je leest ebooks gemakkelijk op je Kobo e-reader, of op je smartphone of tablet met de bol.com Kobo app. Let op! Ebooks kunnen niet geannuleerd of geretourneerd worden.

Samenvatting

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 beenadded.

Productspecificaties

Inhoud

Taal
en
Bindwijze
E-book
Oorspronkelijke releasedatum
08 november 2012
Ebook Formaat
Adobe ePub
Illustraties
Nee

Betrokkenen

Hoofdauteur
Dieter Jungnickel
Tweede Auteur
Dieter Jungnickel
Hoofdredacteur
E. Becker
Tweede Redacteur
H. Cohen
Hoofduitgeverij
Springer

Vertaling

Eerste Vertaler
t. Schade
Originele titel
Graphs, Networks and Algorithms

Lees mogelijkheden

Lees dit ebook op
Android (smartphone en tablet) | Kobo e-reader | Desktop (Mac en Windows) | iOS (smartphone en tablet) | Windows (smartphone en tablet)

Overige kenmerken

Editie
4
Studieboek
Nee
Verpakking hoogte
35 mm

EAN

EAN
9783642322785
Nog geen reviews

Prijsinformatie en bestellen

De prijs van dit product is 64 euro.
Direct beschikbaar
Verkoop door bol
  • E-book is direct beschikbaar na aankoop
  • E-books lezen is voordelig
  • Dag en nacht klantenservice
  • Veilig betalen
Houd er rekening mee dat je downloadartikelen niet kunt annuleren of retourneren. Bij nog niet verschenen producten kun je tot de verschijningsdatum annuleren.
Zie ook de retourvoorwaarden

Alle bindwijzen en edities (4)

  • 64,00
    Direct beschikbaar
  • 65,16
    1 - 2 weken Tooltip
  • 102,22
    1 - 2 weken Tooltip
  • 98,30
    1 - 2 weken Tooltip