|
On Order
$137.95
New Hardcover
Currently out of stock.
 available for shipping or prepaid pickup only
Other titles in the Discrete Mathematics and Its Applications series:
A Java Library of Graph Algorithms and Optimization (Discrete Mathematics and Its Applications)by Hang T. Lau
Synopses & ReviewsPublisher Comments: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. Book News Annotation:Lau (McGill University) provides the source code for 60 Java programs
that implement some of the most popular graph algorithms and
mathematical programming procedures. The parameters and an example
are provided for each program, most of which address random graph
generation, connectivity, paths, cycles, and assignment problems. The
code on the CD-ROM has been tested in Java 2 platform standard
edition development kit 5.0 with Windows XP.
Annotation ©2007 Book News, Inc., Portland, OR (booknews.com) Synopsis: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. An accompanying CD-ROM contains all of the Java code included in the book. Synopsis: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. Synopsis:A Java Library of Graph Algorithms and Optimization provides a library of computer programs in Java that can be used for problem solving in graph theory and optimization. This complete, comprehensive source of computer programs can be used for the methodology or implementation behind them. Each procedure is described along with its methods, function parameters, supplementary remarks, and Java code. The book also features numerous worked examples as a guide to using each program as well as an accompanying CD-ROM that contains all of the Java code included in the book. What Our Readers Are SayingAdd a comment for a chance to win!Average customer rating based on 1 comment:
Product Details
Other books you might like
Related Subjects
Science and Mathematics » Mathematics » Foundations and Logic
|
|||||||||
|
|
||||||||||
|
Follow us on...
|
||||||||||
Don't Miss
