A Java Library of Graph Algorithms and Optimization by Hang T. Lau

due to its portability and platform-independence, Java is the appropriate computing device programming language to exploit while engaged on graph algorithms and different mathematical programming difficulties. amassing the most well known graph algorithms and optimization tactics, A Java Library of Graph Algorithms and Optimization offers the resource code for a library of Java courses that may be used to unravel difficulties in graph thought and combinatorial optimization. Self-contained and mostly autonomous, every one subject begins with an issue description and an summary of the answer strategy, by way of its parameter checklist specification, resource code, and a try out instance that illustrates the use of the code.

The publication starts off with a bankruptcy on random graph iteration that examines bipartite, standard, hooked up, Hamilton, and isomorphic graphs in addition to spanning, categorised, and unlabeled rooted timber. It then discusses connectivity methods, via a paths and cycles bankruptcy that comprises the chinese language postman and touring salesman difficulties, Euler and Hamilton cycles, and shortest paths. the writer proceeds to explain attempt methods related to planarity and graph isomorphism. next chapters care for graph coloring, graph matching, community circulate, and packing and masking, together with the project, bottleneck task, quadratic task, a number of knapsack, set masking, and set partitioning difficulties. the ultimate chapters discover linear, integer, and quadratic programming. The appendices supply references that provide additional info of the algorithms and contain the definitions of many graph idea phrases utilized in the book.