Disc included. Open Books is a nonprofit social venture that provides literacy experiences for thousands of readers each year through inspiring programs and creative capitalization of books.

Seller Inventory # mon0000805038

Contact seller

Report this item

Bibliographic Details

Title

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

Publisher

Chapman and Hall/CRC

Publication Date

2006

Language

English

ISBN 10

1584887184

ISBN 13

9781584887188

Binding

hardcover

Condition

Very Good

Seller catalogs

About this title

Synopsis

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

Open Books is a nonprofit social venture that provides literacy experiences for thousands of readers each year through inspiring programs and creative capitalization of books. We are a 501(c)3 with all proceeds going to our literacy enrichment programs.

Visit Seller's Storefront

Seller's business information

Open Books, Ltd.
651 W. Lake St., Chicago, IL, 60661, U.S.A.

Sale & Shipping Terms

Terms of Sale

All items subject to prior sale. Refunds and returns within 30 days of shipment with authorization.

Shipping Terms

All orders ship within 2 business days. Most domestic orders shipped with USPS Bound Printed Matter with delivery confirmation, delivery within 2 weeks. Expedited orders ship via USPS Priority Mail. International Orders ship via USPS International Prioriry, delivery between 7-21 business days. Standard international shipping is expedited service.

Shipping rates within U.S.A.

Shipping rates within U.S.A.
Order quantity	5 to 14 business days	3 to 6 business days
First item	US$ 3.99	US$ 7.99

Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.