Discrete Mathematics and Its Applications
Series: Discrete Mathematics and Its Applications; 25;
- Publisher's listprice GBP 94.99
-
45 381 Ft (43 220 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 10% (cc. 4 538 Ft off)
- Discounted price 40 843 Ft (38 898 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
45 381 Ft
Availability
Uncertain availability. Please turn to our customer service.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Edition number 1
- Publisher Chapman and Hall
- Date of Publication 1 January 2005
- ISBN 9781584883968
- Binding Hardback
- No. of pages504 pages
- Size 234x158 mm
- Weight 840 g
- Language English
- Illustrations 247 Illustrations, black & white; 247 Tables, black & white 0
Categories
Short description:
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.
MoreLong description:
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.
Discrete Mathematics and Its Applications
45 381 HUF
40 843 HUF
Get Started in Beginner's Polish: Teach Yourself
11 204 HUF
9 523 HUF
Mapping the Dynamics of Science and Technology: Sociology of Science in the Real World
