ATU Sligo /ATU St Angela's

go

Amazon cover image
Image from Amazon.com

A Java library of graph algorithms and optimization /

By: Lau, H. T. (Hang Tong), 1952-.
Series: Discrete mathematics and its applications.Publisher: Boca Raton : Chapman & Hall/CRC, c2007Description: 386 p. ; 27 cm + 1 CD-ROM (4 3/4 in.).Content type: text Media type: unmediated Carrier type: volumeISBN: 1584887184 (acidfree paper); 9781584887188:; 9781584887188 (acid-free paper); 1584887192 (acid-free paper); 9781584887195 (acid-free paper).Subject(s): Java (Computer program language) | Computer algorithms | Java (Computer program language) | Combinatorial optimizationDDC classification: 005.133
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.
Summary: This is a library of computer programs in Java that can be used for problem solving in graph theory and optimisation. Each procedure is described along with its methods, function parameters, supplementary remarks, and Java code.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Copy number Status Date due Barcode Item holds
Standard Loan Standard Loan ATU Sligo Yeats Library Main Lending Collection 005.133 JAV (Browse shelf(Opens below)) 1 Available 0066638
Total holds: 0

Includes bibliographical references (p. 377-381) and index.

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.

This is a library of computer programs in Java that can be used for problem solving in graph theory and optimisation. Each procedure is described along with its methods, function parameters, supplementary remarks, and Java code.

Share