Material Detail

The Poor Cartographer

In this activity, learners help a poor cartographer color in the countries on a map, making sure each country is colored a different color than any of its neighbors. Through this exercise, learners discover the "has-to-be" rule and the value of place-holders. This activity reveals the complexity of graph coloring algorithms in computer science. Variations, extensions, background information, and solutions are included in the PDF....

Keywords:: Coloring, Cartography, Problem Solving, NSDL, Probability, Representation, Nodes, Graph, Algorithms, Exponential Time, General, Information and Communication, Map, Computer & Information Sciences, Computer Engineering, Young Engineers, Geoscience, Heuristics, Mathematics, Four Color Theorem, Graph Coloring, Place-holder, Engineering, Computing and Information, Maps, Place-Holders, Technology, Computer Science, Education, Patterns, Logic

Disciplines:

Science and Technology / Computer Science

More...

Go to Material

Bookmark / Add to Course ePortfolio

Create a Learning Exercise

Add Accessibility Information

Rate

Add a Comment

Quality

User Rating
Comments
Learning Exercises
Bookmark Collections
Course ePortfolios
Accessibility Info

Report Broken Link
Report as Inappropriate

More about this material

Material Type:: Simulation
Date Added to MERLOT:: July 27, 2016
Date Modified in MERLOT:: July 27, 2016
Authors:: Brian Mason Scientific and Technical Trust
Computer Science Unplugged
Google Inc.
Ian Witten
Mike Fellows
Tim Bell
Submitter:: Barbra Bied Sperling

Primary Audience:: Grade School, Middle School, High School
Technical Format:: Website
Mobile Compatibility:: Not specified at this time
Language:: English
Cost Involved:: No
Source Code Available:: No
Accessibility Information Available:: Unknown
Creative Commons:: This work is licensed under a Attribution-NonCommercial-NoDerivs 3.0 United States