0
Your cart

Your cart is empty

Books > Computing & IT > Computer programming > Programming languages

Buy Now

A Java Library of Graph Algorithms and Optimization (Paperback) Loot Price: R1,797
Discovery Miles 17 970
A Java Library of Graph Algorithms and Optimization (Paperback): Hang T. Lau

A Java Library of Graph Algorithms and Optimization (Paperback)

Hang T. Lau

Series: Discrete Mathematics and Its Applications

 (sign in to rate)
Loot Price R1,797 Discovery Miles 17 970 | Repayment Terms: R168 pm x 12*

Bookmark and Share

Expected to ship within 12 - 17 working days

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.

General

Imprint: Crc Press
Country of origin: United Kingdom
Series: Discrete Mathematics and Its Applications
Release date: September 2019
First published: 2006
Authors: Hang T. Lau
Dimensions: 254 x 178mm (L x W)
Format: Paperback
Pages: 400
ISBN-13: 978-0-367-39013-6
Categories: Books > Computing & IT > Computer programming > Programming languages > General
LSN: 0-367-39013-2
Barcode: 9780367390136

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

You might also like..

Problem Solving with C++ - Global…
Walter Savitch Paperback R2,400 Discovery Miles 24 000
C++ Programming - Program Design…
D. Malik Paperback R1,660 R1,485 Discovery Miles 14 850
C++ How to Program: Horizon Edition
Harvey Deitel, Paul Deitel Paperback R1,779 Discovery Miles 17 790
Java How to Program, Late Objects…
Paul Deitel, Harvey Deitel Paperback R900 R750 Discovery Miles 7 500
Advanced Visual Basic 6 - Power…
Matthew Curland, Gary Clarke Paperback R1,247 Discovery Miles 12 470
C How to Program: With Case Studies in…
Paul Deitel, Harvey Deitel Paperback R2,192 Discovery Miles 21 920
Prolog Programming for Artificial…
Ivan Bratko Paperback R2,181 Discovery Miles 21 810
Advanced SQL with SAS
Christian F. G. Schendera Hardcover R2,425 Discovery Miles 24 250
Objects First with Java: A Practical…
David Barnes Paperback R2,376 Discovery Miles 23 760
CSS and HTML for beginners - A Beginners…
Ethan Hall Hardcover R887 Discovery Miles 8 870
A Day in Code- Python - Learn to Code in…
Shari Eskenas Hardcover R632 Discovery Miles 6 320
Advanced Python Commands - Become a…
Manuel Mcfeely Hardcover R848 R703 Discovery Miles 7 030

See more

Partners