Discrete Mathematics and Its Applications by Kocay, William; Kreher, Donald L.;

Sorozatcím: Discrete Mathematics and Its Applications; 25;

10% KEDVEZMÉNY?
A kedvezmény csak az 'Értesítés a kedvenc témákról' hírlevelünk címzettjeinek rendeléseire érvényes.

Kiadói listaár GBP 94.99
Az ár azért becsült, mert a rendelés pillanatában nem lehet pontosan tudni, hogy a beérkezéskor milyen lesz a forint árfolyama az adott termék eredeti devizájához képest. Ha a forint romlana, kissé többet, ha javulna, kissé kevesebbet kell majd fizetnie.

45 381 Ft (43 220 Ft + 5% áfa)
Kedvezmény(ek) 10% (cc. 4 538 Ft off)
Kedvezményes ár 40 843 Ft (38 898 Ft + 5% áfa)

45 381 Ft

Beszerezhetőség

Bizonytalan a beszerezhetőség. Érdemes még egyszer keresni szerzővel és címmel. Ha nem talál másik, kapható kiadást, forduljon ügyfélszolgálatunkhoz!

A termék adatai:

Kiadás sorszáma 1
Kiadó Chapman and Hall
Megjelenés dátuma 2005. január 1.

ISBN 9781584883968
Kötéstípus Keménykötés
Terjedelem504 oldal
Méret 234x158 mm
Súly 840 g
Nyelv angol
Illusztrációk 247 Illustrations, black & white; 247 Tables, black & white

Kategóriák

Geometria és topológia Kombinatorika és gráfelmélet Villamosmérnöki tudományok, híradástechnika, műszeripar Számítógépes programozás általában Diszkrét matematika

Rövid leírás:

Graphs, Algorithms, and Optimization is a comprehensive book that features a clear explanation of modern graph theory in a rigorous yet approachable way. Suitable for use as a textbook in either mathematics or computer science courses, it is designed to present graph theory from an algorithmic point of view, allowing for a variety of technical applications. It includes useful programming techniques to solve graph theory problems, and applicable data structures to show how algorithms can be programmed. Additional coverage is provided on discrete optimization and its connection to graph theory, algorithmic complexity and efficiency, NP- completeness, and linear optimization.

Több

Hosszú leírás:

Graph theory offers a rich source of problems and techniques for programming and data structure development, as well as for understanding computing theory, including NP-Completeness and polynomial reduction.

A comprehensive text, Graphs, Algorithms, and Optimization features clear exposition on modern algorithmic graph theory presented in a rigorous yet approachable way. The book covers major areas of graph theory including discrete optimization and its connection to graph algorithms. The authors explore surface topology from an intuitive point of view and include detailed discussions on linear programming that emphasize graph theory problems useful in mathematics and computer science. Many algorithms are provided along with the data structure needed to program the algorithms efficiently. The book also provides coverage on algorithm complexity and efficiency, NP-completeness, linear optimization, and linear programming and its relationship to graph algorithms.

Written in an accessible and informal style, this work covers nearly all areas of graph theory. Graphs, Algorithms, and Optimization provides a modern discussion of graph theory applicable to mathematics, computer science, and crossover applications.

Graph theory offers a rich source of problems and techniques for programming and data structure development, as well as for understanding computing theory, including NP-Completeness and polynomial reduction.

A comprehensive text, Graphs, Algorithms, and Optimization features clear exposition on modern algorithmic graph theory presented in a rigorous yet approachable way. The book covers major areas of graph theory including discrete optimization and its connection to graph algorithms. The authors explore surface topology from an intuitive point of view and include detailed discussions on linear programming that emphasize graph theory problems useful in mathematics and computer science. Many algorithms are provided along with the data structure needed to program the algorithms efficiently. The book also provides coverage on algorithm complexity and efficiency, NP-completeness, linear optimization, and linear programming and its relationship to graph algorithms.

Written in an accessible and informal style, this work covers nearly all areas of graph theory. Graphs, Algorithms, and Optimization provides a modern discussion of graph theory applicable to mathematics, computer science, and crossover applications.

Több

Mostanában megtekintett