A Java Library of Graph Algorithms and Optimization
|
|
|
【推荐级别】
|
☆☆☆☆☆
查看网友评价 |
|
【下载次数】 |
47 次 |
|
【作者】 |
Hang T. Lau
|
【出版社】 |
Chapman & Hall/CRC PRESS
|
|
【文件格式】 |
PDF
|
【ISBN】 |
1-58488-718-4
|
|
【资料语言】 |
英文
|
【文件大小】 |
1.35MB
|
|
【上传时间】 |
2007-10-28
|
【共享者】 |
greatcode
查看他还共享了哪些书籍
|
|
|
资料说明：
|
本书收集了最流行的 图算法 和 优化过程 的 Java 源程序，用以解决图论和组合优化中的问题。
A Java Library of Graph Algorithms and Optimization
Hang T. Lau McGill University, Montreal, Quebec, Canada
Chapman & Hall/CRC PRESS
ISBN: 9781584887188
ISBN 10: 1-58488-718-4
Publication Date: 10/20/2006
Number of Pages: 386
. Contains the source code for a software library of roughly 60 Java procedures for the computation of standard problems in graph theory and optimization
. Explores numerous graph algorithms and combinatorial optimization procedures
. Provides a list of simple parameters for each topic, enabling minimal effort for problem solving
. Features numerous worked examples as guides to using each program
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.
目录：
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
|
|
资料下载
|
打开下载链接
点此链接需花费积分5分。如何获取积分？
注册新会员
积分不够？请用手机短信充值
·请先登录 ，然后下载
·下载后，您的积分会减少5分
·48小时内重复下载该资料不另外扣分
·下载前，请先阅读下载声明
·管理员对书籍只进行了初步审核，如果您发现该书违反了分享规则，请向管理员投诉！
|
·本服务的所有资料文件是其作者提供和网友推荐收集整理的，如有侵犯版权敬请指出。
·所有资料文件的准确性、安全性和完整性未经验证，NetYi不承担用户因使用这些下载内容而造成的任何形式的损失或伤害。
|
|
|
| 客户服务 |
 
 |
电话：028-66868000
13568916094
下班时间请点击此处留言 |
| 注：客服服务时间为周一至周五09：00—17：30，周六周日休息。 |
|
|