A Java Library of Graph Algorithms and Optimization (Hardcover)

INTRODUCTIONRANDOM GRAPH GENERATIONRandom Permutation of n Objects Random GraphRandom Bipartite GraphRandom Regular Graph Random Spanning TreeRandom Labeled Tree Random Unlabeled Rooted TreeRandom Connected GraphRandom Hamilton GraphRandom Maximum Flow Network Random Isomorphic GraphsRandom Isomorphic Regular Graphs CONNECTIVITYMaximum Connectivity Depth-First Search Breadth-First SearchConnected Graph TestingConnected Components Cut NodesStrongly Connected Components Minimal Equivalent Graph Edge ConnectivityMinimum Spanning TreeAll CliquesPATHS AND CYCLES Fundamental Set of Cycles Shortest Cycle LengthOne-Pair Shortest Path All Shortest Path Length Shortest Path TreeAll Pairs Shortest Paths k Shortest Pathsk Shortest Paths without Repeated Nodes Euler Circuit Hamilton Cycle Chinese Postman TourTraveling Salesman Problem PLANARITY TESTINGGRAPH ISOMORPHISM TESTINGCOLORING Node ColoringChromatic PolynomialGRAPH MATCHING Maximum Cardinality MatchingMinimum Sum Perfect MatchingNETWORK FLOW Maximum Network FlowMinimum Cost Network FlowPACKING AND COVERINGAssignment Problem Bottleneck Assignment Problem Quadratic Assignment ProblemMultiple Knapsack Problem Set Covering Problem Set Partitioning ProblemLINEAR PROGRAMMINGRevised Simplex Method Dual Simplex MethodINTEGER PROGRAMMINGZero-One Integer ProgrammingAll Integer Programming Mixed Integer ProgrammingQUADRATIC PROGRAMMINGAPPENDIX A: REFERENCESAPPENDIX B: GRAPH-THEORETIC TERMS INDEX OF PROCEDURES