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: 36.29 GBP
Availability: InStock

Games

Price History & Forecast

Last 82 days • 82 data points

Historical

Generating forecast...

Price Distribution

Price distribution over 82 days • 9 price levels

Days at Price

Current Price

Price Analysis

Most common price: £57 (22 days, 26.8%)

Price range: £36 - £58

Price levels: 9 different prices over 82 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 > Games
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)

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Graphs & Digraphs (Textbooks in Mathematics)

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

Computational Graph Theory: 7 (Computing Supplementa, 7)

Graph-Theoretic Concepts in Computer Science: 23rd International Workshop, WG'97, Berlin, Germany, June 18-20, 1997. Proceedings: 1335 (Lecture Notes in Computer Science, 1335)

Algorithms as a Basis of Modern Applied Mathematics: 404 (Studies in Fuzziness and Soft Computing, 404)

Location, Scheduling, Design and Integer Programming: 3 (International Series in Operations Research & Management Science, 3)

Algorithmic Aspects of Graph Connectivity: 123 (Encyclopedia of Mathematics and its Applications, Series Number 123)

Efficient Algorithms for Listing Combinatorial Structures: 5 (Distinguished Dissertations in Computer Science, Series Number 5)

Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra: In Honour of Peter Paule on his 60th Birthday (Texts & Monographs in Symbolic Computation)

Algorithmic Aspects of Graph Connectivity: 123 (Encyclopedia of Mathematics and its Applications, Series Number 123)

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

Foundations of Network Optimization and Games: 3 (Complex Networks and Dynamic Systems, 3)

Complexity and Approximation: In Memory of Ker-I Ko: 12000 (Lecture Notes in Computer Science, 12000)

Graph Algorithms in the Language of Linear Algebra (Software, Environments, Tools)

Geometric Combinatorics (IAS/Park City Mathematics) (IAS/Park City Mathematics Series)

Modelling and Performance Analysis of Cyclic Systems: 241 (Studies in Systems, Decision and Control, 241)

Treewidth, Kernels, and Algorithms: Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday: 12160 (Lecture Notes in Computer Science, 12160)

Graph Algorithms

Topological Structure and Analysis of Interconnection Networks: 7 (Network Theory and Applications, 7)

Sequential and Parallel Algorithms and Data Structures: The Basic Toolbox

Handbook of Combinatorial Optimization: Supplement Volume A

Combinatorial Programming: Methods and Applications: Proceedings of the NATO Advanced Study Institute held at the Palais des Congrès, Versailles, ... 1974: 19 (Nato Science Series C:, 19)

Graph-Theoretic Concepts in Computer Science: 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007, Revised Papers: 4769 (Lecture Notes in Computer Science, 4769)

Proceedings of ECCS 2014: European Conference on Complex Systems (Springer Proceedings in Complexity)