You are here

A Java Library of Graph Algorithms and Optimization

Publisher: 
Chapman & Hall/CRC
Number of Pages: 
385
Price: 
99.95
ISBN: 
1584887184
Date Received: 
Thursday, November 2, 2006
Reviewable: 
Include In BLL Rating: 
Reviewer Email Address: 
Hang T. Lau
Series: 
Discrete Mathematics and Its Applications 43
Publication Date: 
2007
Format: 
Hardcover with CDROM
Category: 
Monograph

 INTRODUCTION

RANDOM GRAPH GENERATION
Random Permutation of n Objects
Random Graph
Random Bipartite Graph
Random Regular Graph
Random Spanning Tree
Random Labeled Tree
Random Unlabeled Rooted Tree
Random Connected Graph
Random Hamilton Graph
Random Maximum Flow Network
Random Isomorphic Graphs
Random Isomorphic Regular Graphs

CONNECTIVITY
Maximum Connectivity
Depth-First Search
Breadth-First Search
Connected Graph Testing
Connected Components
Cut Nodes
Strongly Connected Components
Minimal Equivalent Graph
Edge Connectivity
Minimum Spanning Tree
All Cliques

PATHS AND CYCLES
Fundamental Set of Cycles
Shortest Cycle Length
One-Pair Shortest Path
All Shortest Path Length
Shortest Path Tree
All Pairs Shortest Paths
k Shortest Paths
k Shortest Paths without Repeated Nodes
Euler Circuit
Hamilton Cycle
Chinese Postman Tour
Traveling Salesman Problem

PLANARITY TESTING

GRAPH ISOMORPHISM TESTING

COLORING
Node Coloring
Chromatic Polynomial

GRAPH MATCHING
Maximum Cardinality Matching
Minimum Sum Perfect Matching

NETWORK FLOW
Maximum Network Flow
Minimum Cost Network Flow

PACKING AND COVERING
Assignment Problem
Bottleneck Assignment Problem
Quadratic Assignment Problem
Multiple Knapsack Problem
Set Covering Problem
Set Partitioning Problem

LINEAR PROGRAMMING
Revised Simplex Method
Dual Simplex Method

INTEGER PROGRAMMING
Zero-One Integer Programming
All Integer Programming
Mixed Integer Programming

QUADRATIC PROGRAMMING

APPENDIX A: REFERENCES
APPENDIX B: GRAPH-THEORETIC TERMS
INDEX OF PROCEDURES

Publish Book: 
Modify Date: 
Tuesday, February 20, 2007

Dummy View - NOT TO BE DELETED