你好! Shipping to Taiwan with premium packaging for just NT$300 

Ship to
Taiwan
0

My Account

  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

menu

Select your country

Americas

Europe

Rest of the world

portada A Java Library of Graph Algorithms and Optimization (Discrete Mathematics and its Applications)
Type
Physical Book
Publisher
Author
Language
English
Pages
400
Format
Paperback
ISBN13
9780367390136
Edition No.
1

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

Hang T. Lau (Author) · Crc Pr Inc · Paperback

A Java Library of Graph Algorithms and Optimization (Discrete Mathematics and its Applications) - Hang T. Lau

Cheaper New Book Imported to Taiwan
Delivery: 27 Oct - 04 Nov Shipping: 14 to 15 business days.
NT$ 3,287
Faster New Book Imported to Taiwan
Delivery: 15 Oct - 23 Oct Shipping: 6 to 7 business days.
NT$ 3,961
NT$ 3,287

Choose the list to add your product or create one New List

Go to My Wishlists
Calculate shipping cost

Synopsis "A Java Library of Graph Algorithms and Optimization (Discrete Mathematics and its Applications) "

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.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

Is the book original?

All books in our catalog are Original.

In what language is the book written?

The book is written in English.

What is the format of this book?

The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews