Neil Sloane’s Challenge Problems

Neil Sloane is looking for the independence numbers of some graphs with a couple thousand vertices. This is a little tangential to our project (the theory of efficient algorithms for independence number), but certainly of interest. My colleague Dan Cranston pointed out Sloane’s problems to me.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s