Graphs, networks and algorithms

Auteurs

• Dieter Jungnickel

Paramètres

• 589 pages
• 21 heures de lecture

• Informatique, programmation
• Mathématiques

En savoir plus sur le livre

Combinatorial optimization, along with graph algorithms and complexity theory is on the increase in the late-1990s. This book treats the most prominent problems which are polynomially solvable. The Travelling Salesman Problem is discussed as a paradigm of an NP-complete problem.

Achat du livre

• Année de publication: 1999
• Reliure: (rigide)