Vertex Coverings And The Cool Kids Problem
Written by Joe Celko   
Joe Celko has posed another puzzle that requires you to think like a programmer. This one asks us to find the cool kids in a social network - the ones who taken together know everyone else. This is also a classic problem in graph theory and it is NP-compete, something the cool kids probably don't know
Shared publiclyView activity