Download Algorithmische Graphentheorie (De Gruyter Studium) (German by Volker Turau,Christoph Weyer PDF

By Volker Turau,Christoph Weyer

Jedes approach, das aus diskreten Zuständen oder Objekten und Beziehungen zwischen diesen besteht, kann als Graph modelliert werden.

Diese Darstellung ermöglicht den Einsatz graphentheoretischer Algorithmen. Das vorliegende Buch stellt die grundlegenden Algorithmen zur Lösung graphentheoretischer Problemstellungen anhand praktischer Beispiele aus der Informatik vor. Die Algorithmen sind in kompakter shape in einer programmiersprachennahen Notation dargestellt, die eine Übertragung in eine konkrete Implementierung leicht macht. Die praktische Relevanz der behandelten Algorithmen wird in vielen Anwendungen aus Gebieten wie Compilerbau, Künstlicher Intelligenz, Betriebssystemen, Computernetzwerken, Suchmaschinen, examine sozialer Netzwerke und Operations learn demonstriert. Elf Kapitel decken die wichtigsten Teilgebiete der Algorithmischen Graphentheorie ab. Die vorliegende vierte, erweiterte und überarbeitete Auflage des Buches zeichnet sich unter anderem durch ein neues umfangreiches Kapitel über Entwurfsmethoden der Algorithmischen Graphentheorie aus.

Das Buch enthält 280 Übungsaufgaben in verschiedenen Schwierigkeitsgraden, für das Bachelor- und das Masterstudium. Die ausführlichen Lösungen können kostenlos bezogen werden.



Show description

Read Online or Download Algorithmische Graphentheorie (De Gruyter Studium) (German Edition) PDF

Similar combinatorics books

Linear Algebraic Monoids: 134 (Encyclopaedia of Mathematical Sciences)

The speculation of linear algebraic monoids culminates in a coherent combination of algebraic teams, convex geometry, and semigroup conception. The booklet discusses the entire key subject matters intimately, together with type, orbit constitution, representations, common structures, and summary analogues. An specific cellphone decomposition is developed for the fantastic compactification, as is a common deformation for any semisimple team.

Exact Exponential Algorithms (Texts in Theoretical Computer Science. An EATCS Series)

For a very long time desktop scientists have uncommon among speedy and sluggish algo rithms. quickly (or sturdy) algorithms are the algorithms that run in polynomial time, which means the variety of steps required for the set of rules to unravel an issue is bounded by way of a few polynomial within the size of the enter.

Introduction to Calculus and Classical Analysis (Undergraduate Texts in Mathematics)

This article is meant for an honors calculus path or for an advent to  research. related to rigorous research, computational dexterity, and a breadth of  functions, it really is excellent for undergraduate majors. This 3rd variation comprises  corrections in addition to a few extra fabric. a few good points of the textual content comprise: The textual content is totally self-contained and starts off with the genuine quantity  axioms; The imperative is outlined because the quarter lower than the graph, whereas the realm is  outlined for each subset of the aircraft; there's a heavy emphasis on computational difficulties, from the high-school  quadratic formulation to the formulation for the by-product of the zeta functionality at  0; There are functions from many components of research, e.

Geometry of Chemical Graphs: Polycycles and Two-faced Maps (Encyclopedia of Mathematics and its Applications)

Polycycles and symmetric polyhedra look as generalisations of graphs within the modelling of molecular buildings, similar to the Nobel prize successful fullerenes, taking place in chemistry and crystallography. The chemistry has encouraged and trained many fascinating questions in arithmetic and desktop technology, which in flip have steered instructions for synthesis of molecules.

Additional resources for Algorithmische Graphentheorie (De Gruyter Studium) (German Edition)

Example text

Download PDF sample

Rated 4.88 of 5 – based on 17 votes