Curated by
ACT
This paper proposes one of the first scalable methods for estimating the number of clusters of solutions of graph coloring problems using a belief propagation like algorithm.
3 Views
0 Downloads
Concepts
Additional Tags
Classroom Considerations
- This resource is only available on an unencrypted HTTP website.It should be fine for general use, but don’t use it to share any personally identifiable information
Start Your Free Trial
Save time and discover engaging curriculum for your classroom. Reviewed and rated by trusted, credentialed teachers.