A Java Library of Graph Algorithms and Optimization (Discrete Mathematics and Its Applications) (Hardcover)

~ Hang T. Lau (Author) "Most of the random graph generation procedures in this chapter make use of a subprogram that will generate a random permutation of n objects..." (more)
Key Phrases: forward star representation, static private void, int trail, First Graph Second Graph (more...)

Editorial Reviews

Product 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 Details

• Hardcover: 386 pages
• Publisher: Chapman & Hall; 1 edition (October 20, 2006)
• Language: English
• ISBN-10: 1584887184
• ISBN-13: 978-1584887188
• Product Dimensions: 10.1 x 6.9 x 1.1 inches
• Shipping Weight: 1.2 pounds (View shipping rates and policies)
• Average Customer Review: 3.7 out of 5 stars  See all reviews (6 customer reviews)
• Amazon.com Sales Rank: #1,040,225 in Books (See Bestsellers in Books)

Customer Reviews

Most Helpful Customer Reviews

63 of 67 people found the following review helpful:

5.0 out of 5 stars Useful problem-solving tool, February 8, 2007

By	A reader - See all my reviews

This library of ready-to-use programs is extremely useful. I have used the programs with very minimal effort in obtaining solutions to some graph optimization problems. Unfortunately the programs are not well documented; it would be a challenge to make modifications to the code. However, the library serves as an ideal black box tool in solving most of the pedagogical graph theory and optimization problems, especially well suited for users who are not of much concern for the underlying methodology and implementation.

53 of 57 people found the following review helpful:

5.0 out of 5 stars A very handy collection, April 14, 2007

By	Customer - See all my reviews

There are many well-written textbooks that cover the theory
and algorithms on graphs and combinatorial optimization.
Very few provide the computer code for the methods. This
book offers an extensive collection of Java programs in
this area. Each program is self-contained and can be used
independently through parameter passing. The drawback of
the book is that the coding style is not object oriented,
and the programs would be difficult to maintain. The
description of the methods and their implementations is
terse. Hence the book is not intended as a learning text.
But the library of programs is a very convenient handy
device for students and researchers in locating solutions
to classroom didactic problems in graphs and optimization,
which apparently is the main objective of the book.

13 of 14 people found the following review helpful:

1.0 out of 5 stars Printout of Java programs, March 27, 2007

By	lew "lwndw123" (Connecticut, USA) - See all my reviews

This is my third review; my two previous reviews have been removed. I have already notified Amazon about this fact

As I have stated, book is just a printout of Java program, without any explanation how program is doing what is doing, what are program limitations in terms of memory, time and complexity. Programming style is mostly Fortran IV like. Programs are without single line of comment and with non-intuitive variable names, what makes modificatios difficult or impossible. Book can be useful for somebody who needs "black box" library, doesn't need to understand programs and trusts the author that programs fave no flaws