Dominating Sets

By
Not available
(2013-07)

Like the Graph Coloring problem, the dominating set problem is one that no efficient solution has been found for, even though it is very simple to describe. This activity explores the problem, and sets it up as the basis for a the Public Key Encryption activity.

Published by:

Computer Science Unplugged

DOER Persistent Identifier: http://doer.col.org/handle//123456789/2998