A Java Library of Graph Algorithms and Optimization

Author:   Hang T. Lau
Publisher:   Taylor & Francis Ltd
ISBN:  

9780367390136


Pages:   386
Publication Date:   30 August 2019
Format:   Paperback
Availability:   Not yet available   Availability explained
This item is yet to be released. You can pre-order this item and we will dispatch it to you upon its release.

Our Price $116.00 Quantity:  
Pre-Order

Share |

A Java Library of Graph Algorithms and Optimization


Add your own review!

Overview

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.

Full Product Details

Author:   Hang T. Lau
Publisher:   Taylor & Francis Ltd
Imprint:   CRC Press
ISBN:  

9780367390136


ISBN 10:   0367390132
Pages:   386
Publication Date:   30 August 2019
Audience:   College/higher education ,  Tertiary & Higher Education
Format:   Paperback
Publisher's Status:   Forthcoming
Availability:   Not yet available   Availability explained
This item is yet to be released. You can pre-order this item and we will dispatch it to you upon its release.

Table of Contents

Random Graph Generation. Connectivity. Paths and Cycles. Planarity Testing. Graph Isomorphism Testing. Coloring. Graph Matching. Network Flow. Packing and Covering. Linear Programming. Integer Programming. Quadratic Programming. Appendices. Index.

Reviews

Author Information

Lau, Hang T.

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Spring Reading Guide

 

Spring Reading Guide catalogue for book recommendations

Shopping Cart
Your cart is empty
Shopping cart
Mailing List