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. An accompanying CD-ROM contains all of the Java code included in the book.
Inhaltsverzeichnis
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.
