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.

About the Author:

Lau, Hang T.

"About this title" may belong to another edition of this title.

Store Description

Visit Seller's Storefront

Seller's business information

Booktrolls LLC
9600 Bamboo Rd, None, Houston, TX, 77041, U.S.A.

Terms of Sale:

We guarantee the condition of every book as it's described on the Abebooks web
sites. If you're dissatisfied with your purchase (Incorrect Book/Not as
Described/Damaged) or if the order hasn't arrived, you're eligible for a refund
within 30 days of the estimated delivery date. If you've changed your mind about a
book that you've ordered, please use the Ask bookseller a question link to contact
us and we'll respond within 2 business days.

Shipping Terms:

Orders usually ship same or next business day. If you place an expedited order for a heavy or over-sized book, we may contact you to request that you cover the extra shipping cost.

Payment Methods
accepted by seller

Add to Wants

Items related to A Java Library of Graph Algorithms and Optimization...

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

Lau, Hang T.

New - Soft cover

Seller's business information