FREE delivery to all EXCLUSIVE BOOKS stores nationwide. FREE delivery to your door on all orders over R450. Excludes all international deliveries.

  • Safe delivery by Christmas SANTA SAFE
    Java Library of Graph Algorithms and Optimization

Java Library of Graph Algorithms and Optimization

Hang T. Lau
    Product form
      FORMAT: Paperback / softback

      R 3,756.30 Price and availability exclusive to website

      YOU COULD EARN 3,756.30 FUTURE RETAIL DISCOUNTS.
      ESTIMATED DELIVERY: Approx. 10 - 15 Business Days
      BUY NOW PAY LATER
      From R 626.05 per month!
      3x monthly payments of R 1,252.10 with
      4x fortnightly payments of R 939.07 with
      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.
      Format: CONTRIBUTORS: Hang T. Lau EAN: 9780367390136 COUNTRY: United Kingdom PAGES: WEIGHT: 725 g HEIGHT: 254 cm
      PUBLISHED BY: Taylor & Francis Ltd DATE PUBLISHED: 2019-09-11 CITY: GENRE: COMPUTERS / Programming / Games, COMPUTERS / Programming / Algorithms, MATHEMATICS / General, MATHEMATICS / Number Systems WIDTH: 178 cm SPINE:

      Book Themes:

      Programming and scripting languages: general

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      Lau, Hang T.
      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.
      Format: CONTRIBUTORS: Hang T. Lau EAN: 9780367390136 COUNTRY: United Kingdom PAGES: WEIGHT: 725 g HEIGHT: 254 cm
      PUBLISHED BY: Taylor & Francis Ltd DATE PUBLISHED: 2019-09-11 CITY: GENRE: COMPUTERS / Programming / Games, COMPUTERS / Programming / Algorithms, MATHEMATICS / General, MATHEMATICS / Number Systems WIDTH: 178 cm SPINE:

      Book Themes:

      Programming and scripting languages: general

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      Lau, Hang T.

      Recently viewed products

      Login

      Forgot your password?

      Don't have an account yet?
      Create account