A Java Library of Graph Algorithms and Optimization (Discrete Mathematics and Its Applications) - Image 1

£55.51

Chapman and Hall/CRC A Java Library of Graph Algorithms and Optimization (Discrete Mathematics and Its Applications)

Name: A Java Library of Graph Algorithms and Optimization (Discrete Mathematics and Its Applications)
Brand: Chapman and Hall/CRC
Price: 55.51 GBP
Availability: InStock

Algorithms

This is the usual price. Wait for it to drop, or tell us your number.

£56 today · usual range £44–£59 · best ever £44

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 47 days • 47 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 47 days • 6 price levels

Days at Price

Current Price

Price Analysis

Most common price: £49 (20 days, 42.6%)

Price range: £44 - £59

Price levels: 6 different prices over 47 days

Description

Because of its portability and platform-independence, Java is the ideal computer programming language to use when working on graph algorithms and other mathematical programming problems. Collecting some of the most popular graph algorithms and optimization procedures, A Java Library of Graph Algorithms and Optimization provides the source code for a library of Java programs that can be used to solve problems in graph theory and combinatorial optimization. Self-contained and largely independent, each topic starts with a problem description and an outline of the solution procedure, followed by its parameter list specification, source code, and a test example that illustrates the usage of the code. The book begins with a chapter on random graph generation that examines bipartite, regular, connected, Hamilton, and isomorphic graphs as well as spanning, labeled, and unlabeled rooted trees. It then discusses connectivity procedures, followed by a paths and cycles chapter that contains the Chinese postman and traveling salesman problems, Euler and Hamilton cycles, and shortest paths. The author proceeds to describe two test procedures involving planarity and graph isomorphism. Subsequent chapters deal with graph coloring, graph matching, network flow, and packing and covering, including the assignment, bottleneck assignment, quadratic assignment, multiple knapsack, set covering, and set partitioning problems. The final chapters explore linear, integer, and quadratic programming. The appendices provide references that offer further details of the algorithms and include the definitions of many graph theory terms used in the book.

Product Specifications

Brand: Chapman and Hall/CRC
Format: paperback
ASIN: 0367390132
Category: Books > Subjects > Computing & Internet > Programming > Algorithms
Domain: Amazon UK
Release Date: 11 September 2019
Listed Since: 08 August 2019

Barcode

No barcode data available

Chapman and Hall/CRC A Java Library of Graph Algorithms and Optimization (Discrete Mathematics and Its Applications)

This is the usual price. Wait for it to drop, or tell us your number.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

CRC Press - A Java Library of Graph Algorithms and Optimization

Graph and Network Theory: An Applied Approach using Mathematica®: 193 (Springer Optimization and Its Applications, 193)

Handbook of Graph Theory, Combinatorial Optimization, and Algorithms: 34 (Chapman & Hall/CRC Computer and Information Science Series)

Guide to Graph Algorithms: Sequential, Parallel and Distributed (Texts in Computer Science)

Exercises in Graph Theory: 19 (Texts in the Mathematical Sciences, 19)

Graphs & Digraphs (Textbooks in Mathematics)

Graphs & Digraphs (Textbooks in Mathematics)

Topics in Algorithmic Graph Theory: 178 (Encyclopedia of Mathematics and its Applications, Series Number 178)

Graph Theory and Its Applications (Textbooks in Mathematics)

Coloring Mixed Hypergraphs: Theory, Algorithms and Applications (Fields Institute Monographs)

Graph Theory and Its Applications (Textbooks in Mathematics)

Dynamic Programming Multi-Objective Combinatorial Optimization: 331 (Studies in Systems, Decision and Control, 331)

Graphs, Networks and Algorithms: 5 (Algorithms and Computation in Mathematics, 5)

Dynamic Programming Multi-Objective Combinatorial Optimization: 331 (Studies in Systems, Decision and Control, 331)

Techniques for Designing and Analyzing Algorithms (Chapman & Hall/CRC Cryptography and Network Security Series)

Algorithms on Trees and Graphs: With Python Code (Texts in Computer Science)

Algorithms in C, Part 5: Graph Algorithms (3rd Edition) (Pt.5)

Algorithms on Trees and Graphs: With Python Code (Texts in Computer Science)

Graph Theory and Combinatorial Optimization

Graph Theory: An Introduction to Proofs, Algorithms, and Applications (Discrete Mathematics and Its Applications)

Advances In Combinatorial Optimization: Linear Programming Formulations Of The Traveling Salesman And Other Hard Combinatorial Optimization Problems

Graph Edge Coloring: Vizing's Theorem and Goldberg's Conjecture: 75 (Wiley Series in Discrete Mathematics and Optimization)

Algorithms and Data Structures: The Basic Toolbox

Introduction to Graph and Hypergraph Theory - Math Textbook