Tools

LEADER 04023cam 2200589 a 4500

001 ocm70707860;

003 OCoLC;

005 20141212002419.0;

008 060721s2007 flu b 001 0 eng ;

010 a| 2006024036;

015 a| GBA6A26842| bnb;

016 7 a| 0136191102| Uk;

020 a| 1584887184 (acid-free paper);

020 a| 9781584887188 (acid-free paper);

020 a| 1584887192 (acid-free paper);

020 a| 9781584887195 (acid-free paper);

029 1 a| YDXCPb| 2479198;

029 1 a| NLGGCb| 297659502;

029 1 a| NZ1b| 10934582;

035 a| (Sirsi) o70707860;

035 a| (OCoLC)70707860;

049 a| EREE;

050 00 a| QA76.73.J38b| L362 2007;

082 00 a| 005.13/32| 22;

084 a| 31.122| bcl;

084 a| 54.532| bcl;

090 a| QA76.73.J38b| L38 2007;

100 1 a| Lau, H. T.q| (Hang Tong),d| 1952-=| ^A259990;

245 12 a| A Java library of graph algorithms and optimization /c| Hang T. Lau.;

300 a| 386 pages ;c| 27 cm +e| 1 CD-ROM (4 3/4 in.).;

336 a| text2| rdacontent;

337 a| unmediated2| rdamedia;

338 a| volume2| rdacarrier;

490 1 a| Discrete mathematics and its applications;

504 a| Includes bibliographical references (p. 377-381) and index.;

505 0 a| 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 -- A Java Library of Graph Algorithms and Optimization -- 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 -- Contents iii -- 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.;

650 0 a| Java (Computer program language)=| ^A386567;

650 0 a| Computer algorithms.=| ^A285321;

650 0 a| Combinatorial optimization.=| ^A155283;

830 0 a| Discrete mathematics and its applications.=| ^A375546;

856 41 3| Table of contents onlyu| http://www.loc.gov/catdir/toc/ecip0617/2006024036.html;

856 42 3| Publisher descriptionu| http://www.loc.gov/catdir/enhancements/fy0708/2006024036-d.html;

994 a| C0b| ERE;

938 a| Baker & Taylorb| BKTYc| 99.95d| 99.95i| 1584887184n| 0006850118s| active;

938 a| YBP Library Servicesb| YANKn| 2479198;

938 a| Baker and Taylorb| BTCPn| 2006024036;

590 a| Little-345358--305131050915X;

596 a| 1 2;

998 a| 1345389;

999 a| QA76.73.J38 L362 2007w| LCc| 1i| 30372014307901d| 2/23/2022e| 12/10/2019f| 2/14/2013g| 1l| JGESm| JOYNERn| 4p| $39.95q| 1r| Ys| Yt| JGESBKu| 12/14/2007x| BOOKz| JSTACKSo| .STAFF. 0;

A Java library of graph algorithms and optimization / Hang T. Lau.

Author/creator	Lau, H. T., 1952-
Format	Book
Publication Info	Boca Raton : Chapman & Hall/CRC, ©2007.
Description	386 pages ; 27 cm + 1 CD-ROM (4 3/4 in.).
Supplemental Content	Table of contents only
Supplemental Content	Publisher description
Subjects	Java (Computer program language) Computer algorithms. Combinatorial optimization.

Series	Discrete mathematics and its applications Discrete mathematics and its applications. ^A375546
Contents	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 -- A Java Library of Graph Algorithms and Optimization -- 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 -- Contents iii -- 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.
Local note	Little-345358--305131050915X
Bibliography note	Includes bibliographical references (p. 377-381) and index.
LCCN	2006024036
ISBN	1584887184 (acid-free paper)
ISBN	9781584887188 (acid-free paper)
ISBN	1584887192 (acid-free paper)
ISBN	9781584887195 (acid-free paper)

A Java library of graph algorithms and optimization / Hang T. Lau.

Click here for more information about this title