Graphs, networks and algorithms

Autori

• Dieter Jungnickel

Parametri

• 589 pagine
• 21 ore di lettura

• Computer, IT, programmazione
• Matematica

Maggiori informazioni sul libro

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.

Lingua: Inglese

Pubblicato: 1999

(Copertina rigida)