A java library of graph algorithms and optimization Hang T. Lau.

Lau, Hang Tong:

ISBN 10: 1584887192 / ISBN 13: 9781584887195

Published by Boca, Chapman & Hall/CRC, 2007

About this Item

Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 05 LAU 9781584887195 Sprache: Englisch Gewicht in Gramm: 1150.

Seller Inventory # 2506000

Bibliographic Details

• Title: A java library of graph algorithms and optimization Hang T. Lau.
• Publisher: Boca, Chapman & Hall/CRC
• Publication Date: 2007
• Language: English
• ISBN 10: 1584887192
• ISBN 13: 9781584887195
• Binding: Hardcover
• Weight: 1150 grams
• Seller catalogs:
  • SA MATHEMATIK

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.