This examination of graph theory introduces techniques such as minimum-cost spanning tress, shortest-route algorithms, and Euler circuits as tools that can solve real problems. HiMAP Module 6.
HiMAP library now available on CD-ROM product no. 7593
Table of Contents:
SECTION 1: GRAPHS, PATHS, CIRCUITS, AND AN ALGORITHM
SECTION 2: MINIMUM SPANNING TREES AND HOMOGENEITY OF BIMETALLIC OBJECTS
SECTION 3: SHORTEST-ROUTE PROBLEMS
SECTION 4: THE TRAVELING SALESMAN PROBLEM: AN INTRODUCTION TO COMPLEXITY
GLOSSARY
ANNOTATED REFERENCES
ANSWERS TO EXERCISES
You must have a Full Membership to download this resource.
If you're already a member, login here.
COMAP develops curriculum resources, professional development programs, and contest opportunities that are multidisciplinary, academically rigorous, and fun for educators and students. COMAP's educational philosophy is centered around mathematical modeling: using mathematical tools to explore real-world problems.