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

個数:
  • ポイントキャンペーン

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

  • ウェブストア価格 ¥20,915(本体¥19,014)
  • Chapman & Hall/CRC(2019/09発売)
  • 外貨定価 US$ 91.99
  • BLACK FRIDAY ポイント2倍キャンペーン対象商品(~11/29)
  • ポイント 380pt
  • 提携先の海外書籍取次会社に在庫がございます。通常3週間で発送いたします。
    【重要ご説明事項】
    1. 納期遅延や、ご入手不能となる場合が若干ございます。
    2. 複数冊ご注文の場合は、ご注文数量が揃ってからまとめて発送いたします。
    3. 美品のご指定は承りかねます。

    ●3Dセキュア導入とクレジットカードによるお支払いについて
  • 【入荷遅延について】
    世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
    おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。
  • ◆画像の表紙や帯等は実物とは異なる場合があります。
  • ◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
    また、洋書販売価格は、ご注文確定時点での日本円価格となります。
    ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。
  • 製本 Paperback:紙装版/ペーパーバック版/ページ数 400 p.
  • 言語 ENG
  • 商品コード 9780367390136
  • DDC分類 005.133

Full Description

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.

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.

最近チェックした商品